Theoretical Computer Science and General Issues

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011, Proceedings

Editors: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (Eds.)

  • Fast-track conference proceedings
  • State-of-the-art research
  • Up-to-date results
see more benefits

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-642-22935-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $139.00
price for USA
  • ISBN 978-3-642-22934-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 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, USA, in August 2011.
The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included.
APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.

Table of contents (58 chapters)

  • New Tools for Graph Coloring

    Arora, Sanjeev (et al.)

    Pages 1-12

  • Inapproximability of NP-Complete Variants of Nash Equilibrium

    Austrin, Per (et al.)

    Pages 13-25

  • Sparse Recovery with Partial Support Knowledge

    Ba, Khanh Do (et al.)

    Pages 26-37

  • On Capacitated Set Cover Problems

    Bansal, Nikhil (et al.)

    Pages 38-49

  • Bandwidth and Low Dimensional Embedding

    Bartal, Yair (et al.)

    Pages 50-61

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-642-22935-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $139.00
price for USA
  • ISBN 978-3-642-22934-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
14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011, Proceedings
Editors
  • Leslie Ann Goldberg
  • Klaus Jansen
  • R. Ravi
  • José D.P. Rolim
Series Title
Theoretical Computer Science and General Issues
Series Volume
6845
Copyright
2011
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag GmbH Berlin Heidelberg
eBook ISBN
978-3-642-22935-0
DOI
10.1007/978-3-642-22935-0
Softcover ISBN
978-3-642-22934-3
Edition Number
1
Number of Pages
XV, 702
Topics