Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
Authors:
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 101-115
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Boosted sampling2004
- Polylogarithmic inapproximability2003
- Primal-dual approximation algorithms for metric facility location and k-median problems2003
- Provisioning a virtual private network2001
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree ProblemJournal of Algorithms, 2000
- Complexity and Approximation1999
- Some optimal inapproximability results1997
- Improved low-degree testing and its applications1997
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981
- A note on two problems in connexion with graphsNumerische Mathematik, 1959