| Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques: 9th International Workshop on Approximation Algorithms for Com 2006 Edition Contributor(s): Diaz, Josep (Editor), Jansen, Klaus (Editor), Rolim, José D. P. (Editor) |
|
 |
ISBN: 3540380442 ISBN-13: 9783540380443 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback - Other Formats Published: August 2006 Annotation: This book constitutes the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006, held in Barcelona, Spain, in August 2006. The 44 revised full papers presented were carefully reviewed and selected from 105 submissions. Among the topics covered are design and analysis of approximation algorithms, hardness of approximation problems, small spaces and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, game theory, network design and routing, packing and covering, scheduling, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness, derandomization, random combinatorial structures, Markov chains, prohabalistic proof systems, error-correcting codes, etc.
|
| Additional Information |
| BISAC Categories: - Computers | Computer Science - Mathematics | Discrete Mathematics - Computers | Software Development & Engineering - General |
| Dewey: 005.1 |
| LCCN: 2006931401 |
| Series: Lecture Notes in Computer Science |
| Physical Information: 1.19" H x 6.34" W x 9.25" (1.71 lbs) 522 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers. Among the topics covered are design and analysis of approximation algorithms, hardness of approximation problems, small spaces and data streaming algorithms, embeddings and metric space methods, and more. |