Theoretical Computer Science and General Issues
© 2005
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings
Editors: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (Eds.)
Free PreviewBuy this book
- Table of contents (41 chapters)
-
-
The Network as a Storage Device: Dynamic Routing with Bounded Buffers
Pages 1-13
-
Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT
Pages 14-25
-
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs
Pages 26-39
-
A Rounding Algorithm for Approximating Minimum Manhattan Networks
Pages 40-51
-
Packing Element-Disjoint Steiner Trees
Pages 52-61
-
Table of contents (41 chapters)
Read this book on SpringerLink
- Download Preface 1 PDF (41.4 KB)
- Download Table of contents PDF (52.7 KB)
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Book Subtitle
- 8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings
- Editors
-
- Chandra Chekuri
- Klaus Jansen
- José D.P. Rolim
- Luca Trevisan
- Series Title
- Theoretical Computer Science and General Issues
- Series Volume
- 3624
- Copyright
- 2005
- Publisher
- Springer-Verlag Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- eBook ISBN
- 978-3-540-31874-3
- DOI
- 10.1007/11538462
- Softcover ISBN
- 978-3-540-28239-6
- Edition Number
- 1
- Number of Pages
- XI, 495
- Topics
