Book contents
- Frontmatter
- Contents
- Preface
- I An Introduction to the Techniques
- II Further Uses of the Techniques
- 9 Further Uses of Greedy and Local Search Algorithms
- 10 Further Uses of Rounding Data and Dynamic Programming
- 11 Further Uses of Deterministic Rounding of Linear Programs
- 12 Further Uses of Random Sampling and Randomized Rounding of Linear Programs
- 13 Further Uses of Randomized Rounding of Semidefinite Programs
- 14 Further Uses of the Primal-Dual Method
- 15 Further Uses of Cuts and Metrics
- 16 Techniques in Proving the Hardness of Approximation
- 17 Open Problems
- Appendix A Linear Programming
- Appendix B NP-Completeness
- Bibliography
- Author Index
- Subject Index
12 - Further Uses of Random Sampling and Randomized Rounding of Linear Programs
from II - Further Uses of the Techniques
Published online by Cambridge University Press: 05 June 2012
- Frontmatter
- Contents
- Preface
- I An Introduction to the Techniques
- II Further Uses of the Techniques
- 9 Further Uses of Greedy and Local Search Algorithms
- 10 Further Uses of Rounding Data and Dynamic Programming
- 11 Further Uses of Deterministic Rounding of Linear Programs
- 12 Further Uses of Random Sampling and Randomized Rounding of Linear Programs
- 13 Further Uses of Randomized Rounding of Semidefinite Programs
- 14 Further Uses of the Primal-Dual Method
- 15 Further Uses of Cuts and Metrics
- 16 Techniques in Proving the Hardness of Approximation
- 17 Open Problems
- Appendix A Linear Programming
- Appendix B NP-Completeness
- Bibliography
- Author Index
- Subject Index
Summary
- Type
- Chapter
- Information
- The Design of Approximation Algorithms , pp. 309 - 332Publisher: Cambridge University PressPrint publication year: 2011