Approximability of combinatorial problems with multi-agent submodular cost functions

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

Volumn , Issue , 2009, Pages 755-764

  Goel, Gagan ^a   Karande, Chinmay ^a   Tripathi, Pushkar ^a   Wang, Lei ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC FRAMEWORK; APPROXIMABILITY; COMBINATORIAL PROBLEM; COMPLEX SYSTEMS; COVERING PROBLEMS; MULTI-AGENT; MULTIPLE AGENTS; PERFECT MATCHINGS; SHORTEST PATH; SPANNING TREE; SUBMODULAR; UPPER AND LOWER BOUNDS; UTILITY FUNCTIONS; VERTEX COVER;

COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS;

COST FUNCTIONS;

EID: 77952394036     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.81     Document Type: Conference Paper

References (26)

1. R. Bar-Yehuda and S. Even. A linear time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms, 2:198-203, 1981.
2. B. Bollobas. Random Graphs. Cambridge University Press, 2001.
3. Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. Maximizing a submodular set function subject to a matroid constraint (extended abstract). In IPCO, pages 182-196, 2007.
4. Irit Dinur and Samuel Safra. On the hardness of approximating minimum vertex cover. Annals of Mathematics, 162:2005, 2005.
5. Uriel Feige, Vahab S. Mirrokni, and Jan Vondrák. Maximizing non-monotone submodular functions. In FOCS, pages 461-471, 2007.
6. Uriel Feige and Jan Vondrák. Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. In FOCS, pages 667-676, 2006.
7. Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, and Vahab S. Mirrokni. Approximating submodular functions everywhere. In SODA, pages 535-544, 2009.
8. Ara Hayrapetyan, Chaitanya Swamy, and Éva Tardos. Network design for information networks. In SODA, pages 933-942, 2005.
9. Satoru Iwata. A faster scaling algorithm for minimizing submodular functions. SIAM J. Comput., 32(4):833-840, 2003.
10. Satoru Iwata. Submodular function minimization. Math. Program., 112(1):45-64, 2008.
11. Satoru Iwata, Lisa Fleischer, and Satoru Fujishige. A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM, 48(4):761-777, 2001.
12. Satoru Iwata and Kiyohito Nagano. Submodular function minimization under covering constraints. Foundations of Computer Science, Annual IEEE Symposium on, 2009.
13. Satoru Iwata and James B. Orlin. A simple combinatorial algorithm for submodular function minimization. In SODA '09: Proceedings of the Nineteenth Annual ACM - SIAM Symposium on Discrete Algorithms, pages 1230-1237, 2009.
14. Subhash Khot. On the power of unique 2-prover 1-round games. In STOC, pages 767-775, 2002. (Pubitemid 35009440)
15. Subhash Khot, Richard J. Lipton, Evangelos Markakis, and Aranyak Mehta. Inapproximability results for combinatorial auctions with submodular utility functions. Algorithmica, 52(1):3-18, 2008.
16. Subhash Khot and Oded Regev. Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci., 74(3):335-349, 2008.
17. Vahab S. Mirrokni, Michael Schapira, and Jan Vondrák. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. In ACM Conference on Electronic Commerce, pages 70-77, 2008.
18. Noam Nisan. The communication complexity of approximate set packing and covering. In ICALP, pages 868-875, 2002.
19. James B. Orlin. A faster strongly polynomial time algorithm for submodular function minimization. In IPCO, pages 240-251, 2007.
20. A. Schrijver. A combinatorial algorithm minimizing submod-ular functions in strongly polynomial time. J. Comb. Theory, Ser. B, 80(2):346-355, 2000.
21. Yogeshwer Sharma, Chaitanya Swamy, and David P. Williamson. Approximation algorithms for prize collecting forest problems with submodular penalty functions. In SODA, pages 1275-1284, 2007.
22. Maxim Sviridenko. A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett., 32(1):41-43, 2004.
23. Zoya Svitkina and Lisa Fleischer. Submodular approximation: Sampling-based algorithms and lower bounds. In FOCS, pages 697-706, 2008.
24. Zoya Svitkina and Éva Tardos. Facility location with hierarchical facility costs. In SODA, pages 153-161, 2006.
25. Jan Vondrák. Optimal approximation for the submodular welfare problem in the value oracle model. In STOC, pages 67-74, 2008.
26. L. A. Wolsey. An analysis of the greedy algorithm for the submodular set covering problem. In Combinatorica, pages 385-393, 1982.