Theoretical Computer Science and General Issues

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008

Editors: Goel, A., Jansen, K., Rolim, J., Rubinfeld, R. (Eds.)

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-540-85363-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $149.00
price for USA
  • ISBN 978-3-540-85362-6
  • 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 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008.

The 20 revised full papers of the APPROX 2008 workshop were carefully reviewed and selected from 42 submissions and focus on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM 2008 is concerned with applications of randomness to computational and combinatorial problems and accounts for 27 revised full papers, also diligently reviewed and selected out of 52 workshop submissions.

Table of contents (47 chapters)

  • Approximating Optimal Binary Decision Trees

    Adler, Micah (et al.)

    Pages 1-9

  • Santa Claus Meets Hypergraph Matchings

    Asadpour, Arash (et al.)

    Pages 10-20

  • Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction

    Bădoiu, Mihai (et al.)

    Pages 21-34

  • Connected Vertex Covers in Dense Graphs

    Cardinal, Jean (et al.)

    Pages 35-48

  • Improved Approximation Guarantees through Higher Levels of SDP Hierarchies

    Chlamtac, Eden (et al.)

    Pages 49-62

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-540-85363-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $149.00
price for USA
  • ISBN 978-3-540-85362-6
  • 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
11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008
Editors
  • Ashish Goel
  • Klaus Jansen
  • José Rolim
  • Ronitt Rubinfeld
Series Title
Theoretical Computer Science and General Issues
Series Volume
5171
Copyright
2008
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-85363-3
DOI
10.1007/978-3-540-85363-3
Softcover ISBN
978-3-540-85362-6
Edition Number
1
Number of Pages
XII, 604
Topics