Theoretical Computer Science and General Issues

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012, Proceedings

Editors: Gupta, A., Jansen, K., Rolim, J.D.P., SERVEDIO, R. (Eds.)

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

Buy this book

eBook $89.00
price for USA in USD (gross)
  • ISBN 978-3-642-32512-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $119.00
price for USA in USD
  • ISBN 978-3-642-32511-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 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2012, and the 16th International Workshop on Randomization and Computation, RANDOM 2012, held in Cambridge, Massachusetts, USA, in August 2011. The volume contains 28 contributed papers, selected by the APPROX Program Committee out of 70 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 67 submissions. 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 (49 chapters)

Table of contents (49 chapters)
  • A New Point of NP-Hardness for 2-to-1 Label Cover

    Austrin, Per (et al.)

    Pages 1-12

  • Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems

    Austrin, Per (et al.)

    Pages 13-24

  • Additive Approximation for Near-Perfect Phylogeny Construction

    Awasthi, Pranjal (et al.)

    Pages 25-36

  • Improved Spectral-Norm Bounds for Clustering

    Awasthi, Pranjal (et al.)

    Pages 37-49

  • Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs

    Berman, Piotr (et al.)

    Pages 50-60

Buy this book

eBook $89.00
price for USA in USD (gross)
  • ISBN 978-3-642-32512-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $119.00
price for USA in USD
  • ISBN 978-3-642-32511-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
15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012, Proceedings
Editors
  • Anupam Gupta
  • Klaus Jansen
  • José D.P. Rolim
  • ROCCO SERVEDIO
Series Title
Theoretical Computer Science and General Issues
Series Volume
7408
Copyright
2012
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-32512-0
DOI
10.1007/978-3-642-32512-0
Softcover ISBN
978-3-642-32511-3
Edition Number
1
Number of Pages
XV, 674
Number of Illustrations
21 b/w illustrations
Topics