Theoretical Computer Science and General Issues

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings

Editors: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (Eds.)

  • Conference Proceedings of the International Workshop on Approximation, Randomization, and Combinatorial Optimization

Buy this book

eBook $99.00
price for USA (gross)
  • ISBN 978-3-642-40328-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $131.00
price for USA
  • ISBN 978-3-642-40327-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

This book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems.

Table of contents (48 chapters)

  • Spectral Sparsification in Dynamic Graph Streams

    Ahn, Kook Jin (et al.)

    Pages 1-10

  • The Online Stochastic Generalized Assignment Problem

    Alaei, Saeed (et al.)

    Pages 11-25

  • On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems

    Austrin, Per (et al.)

    Pages 26-41

  • Approximating Large Frequency Moments with Pick-and-Drop Sampling

    Braverman, Vladimir (et al.)

    Pages 42-57

  • Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams

    Braverman, Vladimir (et al.)

    Pages 58-70

Buy this book

eBook $99.00
price for USA (gross)
  • ISBN 978-3-642-40328-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $131.00
price for USA
  • ISBN 978-3-642-40327-9
  • 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
16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings
Editors
  • Prasad Raghavendra
  • Sofya Raskhodnikova
  • Klaus Jansen
  • José D.P. Rolim
Series Title
Theoretical Computer Science and General Issues
Series Volume
8096
Copyright
2013
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-40328-6
DOI
10.1007/978-3-642-40328-6
Softcover ISBN
978-3-642-40327-9
Edition Number
1
Number of Pages
XIV, 716
Number of Illustrations and Tables
48 b/w illustrations
Topics