Lecture Notes in Computer Science

Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques

4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, August 18-20, 2001

Editors: Goemans, M., Jansen, K., Rolim, J.D.P., Trevisan, L. (Eds.)

Free Preview

Buy this book

eBook $74.99
price for USA in USD (gross)
  • ISBN 978-3-540-44666-8
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA in USD
  • ISBN 978-3-540-42470-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.

Table of contents (31 chapters)

Table of contents (31 chapters)
  • Using Complex Semidefinite Programming for Approximating MAX E2-LIN3

    Goemans, Michel X.

    Pages 1-1

  • Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems

    Impagliazzo, Russell

    Pages 2-5

  • Web Search via Hub Synthesis

    Karlin, Anna R.

    Pages 6-6

  • Error-Correcting Codes and Pseudorandom Projections

    Trevisan, Luca

    Pages 7-9

  • Order in Pseudorandomness

    Vadhan, Salil P.

    Pages 10-11

Buy this book

eBook $74.99
price for USA in USD (gross)
  • ISBN 978-3-540-44666-8
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA in USD
  • ISBN 978-3-540-42470-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Book Subtitle
4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, August 18-20, 2001
Editors
  • Michel Goemans
  • Klaus Jansen
  • Jose D.P. Rolim
  • Luca Trevisan
Series Title
Lecture Notes in Computer Science
Series Volume
2129
Copyright
2001
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-44666-8
DOI
10.1007/3-540-44666-4
Softcover ISBN
978-3-540-42470-3
Series ISSN
0302-9743
Edition Number
1
Number of Pages
IX, 296
Topics