×

Uh-oh, it looks like your Internet Explorer is out of date.

For a better shopping experience, please upgrade now.

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomizatio / Edition 1
     

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomizatio / Edition 1

by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai
 

ISBN-10: 3540407707

ISBN-13: 9783540407706

Pub. Date: 09/29/2003

Publisher: Springer Berlin Heidelberg

This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003.

The 33 revised full papers presented were

Overview

This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003.

The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.

Product Details

ISBN-13:
9783540407706
Publisher:
Springer Berlin Heidelberg
Publication date:
09/29/2003
Series:
Lecture Notes in Computer Science Series , #2764
Edition description:
2003
Pages:
411
Product dimensions:
6.10(w) x 9.17(h) x 0.24(d)

Table of Contents

Contributed Talks of APPROX.- Correlation Clustering with Partial Information.- Improved Linear Time Approximation Algorithms for Weighted Matchings.- Covering Graphs Using Trees and Stars.- An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.- Approximation Algorithms for Channel Allocation Problems in Broadcast Networks.- Asymmetry in k-Center Variants.- An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.- On the Complexity of Approximating k-Dimensional Matching.- Approximating Market Equilibria.- Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.- On the Hardness of Approximate Multivariate Integration.- A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem.- Approximating Rooted Connectivity Augmentation Problems.- Effective Routing and Scheduling in Adversarial Queueing Networks.- Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement.- An Improved Algorithm for Approximating the Radii of Point Sets.- Contributed Talks of RANDOM.- Testing Low-Degree Polynomials over GF(2).- Computational Analogues of Entropy.- Bounds on 2-Query Codeword Testing.- The Lovász Number of Random Graphs.- Perfectly Balanced Allocation.- On Extracting Private Randomness over a Public Channel.- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph.- The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems.- Continuous-Time Quantum Walks on the Symmetric Group.- Distribution-Free Property Testing.- On the Graph-Density of Random 0/1-Polytopes.- A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding.- Tight Bounds for Testing Bipartiteness in General Graphs.- Discrete Quantum Walks Hit Exponentially Faster.- Approximate Testing of Visual Properties.- Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances.- A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries.

Customer Reviews

Average Review:

Post to your social network

     

Most Helpful Customer Reviews

See all customer reviews