How to pay, come what may: Approximation algorithms for demand-robust covering problems

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 367-376

  Dhamdhere, Kedar ^a   Goyal, Vineet ^b   Ravi, R ^b   Singh, Mohit ^b  

^a GOOGLE INC   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COST ROBUST PROBLEMS; ROBUST OPTIMIZATION; STOCHASTIC OPTIMIZATION PROBLEMS;

ALGORITHMS; APPROXIMATION THEORY; COST EFFECTIVENESS; DATA REDUCTION; MATHEMATICAL MODELS; OPTIMIZATION; RANDOM PROCESSES;

PROBLEM SOLVING;

EID: 33745610565     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.42     Document Type: Conference Paper

References (23)

1. Dimitris Bertsimas and Melvyn Sim. The price of robustness. Operation Research, 52(2):35-53.
2. Dimitris Bertsimas and Melvyn Sim. Robust discrete optimization and network flows. Mathematical Programming Series B, 98:49-71.
3. J. Birge and F. Louveaux. Introduction to Stochastic Programming. Springer, Berlin, 1997.
4. George B. Dantzig. Linear programming under uncertainty. Management Sci., 1:197-206, 1955.
5. Kedar Dhamdhere, R. Ravi, and Mohit Singh. On two-stage stochastic minimum spanning trees. In IPCO, 2005.
6. Guy Even, Joseph Naor, Satish Rao, and Baruch Schieber. Divide-and-conquer approximation algorithms via spreading metrics. In IEEE Symposium on Foundations of Computer Science, pages 62-71, 1995.
7. Guy Even, Joseph Naor, Baruch Schieber, and Madhu Sudan. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica, 20(2):151-174, 1998.
8. Naveen Garg, Vijay V. Vazirani, and Mihalis Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput., 25(2):235-251, 1996.
9. Anupam Gupta, Martin Pal, R. Ravi, and Amitabh Sinha. Boosted sampling: approximation algorithms for stochastic optimization. In Proceedings of the 36th annual ACM symposium on Theory of computing (STOC), pages 417-426, 2004.
10. Anupam Gupta, R. Ravi, and Amitabh Sinha. An edge in time saves nine: LP rounding approximation algorithms for stochastic network design. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2004.
11. Nicole Immorlica, David Karger, Maria Minkoff, and Vahab Mirrokni. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems.
12. P. Kouvelis and G. Yu. Robust Discrete Optimisation and Its Applications. Kluwer Academic Publishers, Netherlands, 1997.
13. F. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 422-431, 1988.
14. R. D. Luce and H. Raiffa. Games and Decision. Wliey, New York, 1957.
15. M. Mahdian, Y. Ye, and J. Zhang. A 1.52 approximation algorithm for the uncapacitated facility location problem. In Approximation Algorithms for Combinatorial Optimization (APPROX), pages 229-242, 2002.
16. J. W. Milnor. Games against nature. In R. M. Thrall, C. H. Coombs, and R. L. Davis, editors, Decision Processes. Wiley.
17. J. M. Mulvey, M. J. Verderbel, and S. A. Zenios. Robust optimisation of large scale systems. Technical Report SOR-91-13, Statistics and Operations Research, Princeton University, Princeton, NJ, 1994.
18. Yury Nikulin. Robustness in combinatorial optimization and scheduling theory: An annotated bibliography. webpage, 2004. http://www.optimization- online.org/ DB_FILE/2004/11/995.pdf.
19. R. Ravi and Amitabh Sinha. Hedging uncertainty: Approximation algorithms for stochastic optimization problems. In IPCO, pages 101-115, 2004.
20. G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In Proc. of ACM/SIAM Symposium on Discrete Algorithms (SODA), pages 770-779, 2000.
21. M. J. Rosenblatt and H. L. Lee. A robustness approach to facilities design. International Journal of Production Research, 25:479-486, 1987.
22. P. D. Seymour. Packing directed circuits fractionally. Combinatorica, 15:281-288, 1995.
23. David Shmoys and Chaitanya Swamy. Stochastic optimization is (almost) as easy as deterministic optimization. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2004.