Thresholded covering algorithms for robust and max-min optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6198 LNCS, Issue PART 1, 2010, Pages 262-274

  Gupta, Anupam ^a   Nagarajan, Viswanath ^b   Ravi, R ^c  

^a Carnegie Mellon University   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COVERING ALGORITHMS; COVERING PROBLEMS; MAX-MIN; MULTICUTS; ROBUST MODELS; ROBUST OPTIMIZATION; SET COVER PROBLEM; STEINER FORESTS; STEINER TREES;

LINGUISTICS; OPTIMIZATION; TRANSLATION (LANGUAGES);

APPROXIMATION ALGORITHMS;

EID: 77955330979     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14165-2_23     Document Type: Conference Paper

References (25)

1. Agrawal, S., Ding, Y., Saberi, A., Ye, Y.: Correlation Robust Stochastic Optimization. In: SODA (2010)
2. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, S.: The Online Set Cover Problem. In: STOC, pp. 100-105 (2003)
3. Calinescu, G., Chekuri, C., Pál, M., Vondrák, J.: Maximizing a monotone submodular function under a matroid constraint. In: Fischetti, M., Williamson, D. P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 182-196. Springer, Heidelberg (2007)
4. Dhamdhere, K., Goyal, V., Ravi, R., Singh, M.: How to pay, come what may: Approximation algorithms for demand-robust covering problems. In: FOCS, pp. 367-378 (2005)
5. Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. System Sci. 69 (3), 485-497 (2004)
6. Feige, U., Jain, K., Mahdian, M., Mirrokni, V. S.: Robust combinatorial optimization with exponential scenarios. In: Fischetti, M., Williamson, D. P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 439-453. Springer, Heidelberg (2007)
7. Fisher, M. L., Nemhauser, G. L., Wolsey, L. A.: An analysis of approximations for maximizing submodular set functions II. Mathematical Programming Study 8, 73-87 (1978)
8. Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms 53 (1), 55-84 (2004)
9. Garg, N.: Saving an epsilon: a 2-approximation for the k-mst problem in graphs. In: STOC 2005: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pp. 396-402 (2005)
10. Golovin, D., Goyal, V., Ravi, R.: Pay today for a rainy day: improved approximation algorithms for demand-robust min-cut and shortest path problems. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 206-217. Springer, Heidelberg (2006)
11. Golovin, D., Nagarajan, V., Singh, M.: Approximating the k-multicut problem. In: SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 621-630 (2006)
12. Gupta, A., Hajiaghayi, M. T., Nagarajan, V., Ravi, R.: Dial a ride from k-forest. In: Proceedings of the 15th Annual European Symposium on Algorithms, pp. 241-252 (2007)
13. Gupta, A., Nagarajan, V., Ravi, R.: Thresholded covering algorithms for robust and max-min optimization (2009), (full version) http://arxiv.org/abs/ 0912.1045
14. Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V. S.: On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. In: SODA, pp. 691-700 (2004)
15. Khandekar, R., Kortsarz, G., Mirrokni, V. S., Salavatipour, M. R.: Two-stage robust network design with exponential scenarios. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol. 5193, pp. 589-600. Springer, Heidelberg (2008)
16. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
17. Nemhauser, G. L., Wolsey, L. A., Fisher, M. L.: An analysis of approximations for maximizing submodular set functions I. Mathematical Programming 14, 265-294 (1978)
18. Räcke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: STOC, pp. 255-264 (2008)
19. Ravi, R., Sinha, A.: Hedging uncertainty: approximation algorithms for stochastic optimization problems. In: Bienstock, D., Nemhauser, G. L. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 101-115. Springer, Heidelberg (2004)
20. Shmoys, D., Swamy, C.: Stochastic Optimization is (almost) as Easy as Deterministic Optimization. In: FOCS, pp. 228-237 (2004)
21. Slavík, P.: Improved performance of the greedy algorithm for partial cover. Inf. Process. Lett. 64 (5), 251-254 (1997)
22. Srinivasan, A.: Improved approximation guarantees for packing and covering integer programs. SIAM J. Comput. 29 (2), 648-670 (1999)
23. Sviridenko, M.: A note on maximizing a submodular set function subject to knapsack constraint. Operations Research Letters 32, 41-43 (2004)
24. Swamy, C.: Algorithms for Probabilistically-Constrained Models of Risk-Averse Stochastic Optimization with Black-Box Distributions (2008), http://arxiv.org/abs/0805.0389
25. Vondrák, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: STOC, pp. 67-74 (2008)