Symmetry and approximability of submodular maximization problems

SIAM Journal on Computing

Volumn 42, Issue 1, 2013, Pages 265-304

  Vondrák, Jan ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Approximation algorithms; Query complexity; Submodular functions

Indexed keywords

APPROXIMATION FACTOR; BEST APPROXIMATIONS; CARDINALITY CONSTRAINTS; CONSTANT FACTOR APPROXIMATION; MAXIMIZATION PROBLEM; OPTIMIZATION PROBLEMS; QUERY COMPLEXITY; SUBMODULAR FUNCTIONS;

COMBINATORIAL MATHEMATICS; DISTRIBUTED COMPUTER SYSTEMS; HARDNESS; OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 84876228696     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/110832318     Document Type: Conference Paper

References (32)

1. N. Alon and J. Spencer, The Probabilistic Method, 3rd ed., John Wiley & Sons, Hoboken, NJ, 2008.
2. A. Ageev and M. Sviridenko, Pipage rounding: a new method of constructing algorithms with proven performance guarantee, J. Combin. Optim., 8 (2004), pp. 307-328.
3. N. Buchbinder, M. Feldman, J. Naor, and R. Schwartz, A tight linear time (1/2)- approximation for unconstrained submodular maximization, in Proceedings of the 53th IEEE FOCS, 2012.
4. G. Calinescu, C. Chekuri, M. Pal, and J. Vondrak, Maximizing a submodular set function subject to a matroid constraint, in Proceedings of the 12th IPCO, 2007, pp. 182-196.
5. G. Calinescu, C. Chekuri, M. Pál, and J. Vondrak, Maximizing a submodular set function subject to a matroid constraint, SIAM J. Comput., 40 (2011), pp. 1740-1766.
6. S. Dughmi, T. Roughgarden, and Q. Yan, From convex optimization to randomized mechanisms: Towards optimal combinatorial auctions with submodular bidders, in Proceedings of the 43rd ACM STOC, 2011, pp. 149-158.
7. S. Dughmi and J. Vondrak, Limitations of randomized mechanisms for combinatorial auctions, in Proceedings of the 52nd IEEE FOCS, 2011, pp. 502-511.
8. S. Dobzinski and J. Vondrak, From query complexity to computational complexity, in Proceedings of the 44th ACM STOC, 2012, pp. 1107-1116.
9. S. Dobzinski and J. Vondrak, The computational complexity of truthfulness in combinatorial auctions, in Proceedings of the 13th ACM EC, 2012, pp. 405-422.
10. J. Edmonds, Matroids, submodular functions and certain polyhedra, in Combinatorial Structures and Their Applications, Gordon and Breach, New York, 1970, pp. 69-87.
11. J. Edmonds, Matroids and the greedy algorithm, Math. Program., 1 (1971), pp. 127-136.
12. U. Feige, A threshold of ln n for approximating set cover, J. ACM, 45 (1998), pp. 634-652. (Pubitemid 128488790)
13. U. Feige, V. Mirrokni, and J. Vondrak, Maximizing non-monotone submodular functions, SIAM J. Comput., 40 (2011), pp. 1133-1153.
14. L. Fleischer, S. Fujishige, and S. Iwata, A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions, J. ACM, 48 (2001), pp. 761-777.
15. A. Frank, Matroids and submodular functions, in Annotated Biblographies in Combinatorial Optimization, Wiley-Interscience. New York, 1997, pp. 65-80.
16. S. Khot, R. Lipton, E. Markakis, and A. Mehta, Inapproximability results for combinatorial auctions with submodular utility functions, Algorithmica, 52 (2008), pp. 3-18.
17. A. Kulik, H. Shachnai, and T. Tamir, Maximizing submodular set functions subject to multiple linear constraints, in Proceedings of the 20th ACM-SIAM SODA, 2009, pp. 545-554.
18. J. Lee, V. Mirrokni, V. Nagarajan, and M. Sviridenko, Maximizing non-monotone submodular functions under matroid and knapsack constraints, in Proceedings of the 41st ACM STOC, 2009, pp. 323-332.
19. J. Lee, M. Sviridenko, and J. Vondrak, Submodular maximization over multiple matroids via generalized exchange properties, Math. Oper. Res., 35, (2010), pp. 795-806
20. L. Lovász, Submodular functions and convexity, in Mathematical Programming: The State of the Art, A. Bachem et al., eds., Springer-Verlag, Berlin, 1983, pp. 235-257.
21. V. Mirrokni, M. Schapira, and J. Vondrak, Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions, in Proceedings of the 9th ACM EC, 2008, pp. 70-77.
22. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, An analysis of approximations for maximizing submodular set functions I, Math. Program., 14 (1978), pp. 265-294.
23. M. L. Fisher, G. L. Nemhauser, and L. A. Wolsey, An analysis of approximations for maximizing submodular set functions II, Math. Program. Study, 8 (1978), pp. 73-87.
24. G. L. Nemhauser and L. A. Wolsey, Best algorithms for approximating the maximum of a submodular set function, Math. Oper. Res., 3 (1978), pp. 177-188.
25. S. Oveis Gharan and J. Vondrak, Submodular maximization by simulated annealing, in Proceedings of the 22nd ACM-SIAM SODA, 2011, pp. 1098-1116.
26. A. Schrijver, A combinatorial algorithm minimizing submodular functions in strongly polynomial time, J. Combin. Theory Ser. B, 80 (2000), pp. 346-355.
27. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Springer-Verlag, Berlin, 2003.
28. J. Vondrak, Optimal approximation for the submodular welfare problem in the value oracle model, in Proceedings of the 40th ACM STOC, 2008, pp. 67-74
29. J. Vondrak, Submodularity and Curvature: The Optimal Algorithm, RIMS Kokyuroku Bessatsu B23, Kyoto, 2010, pp. 253-266.
30. J. Vondrak, Symmetry and approximability of submodular maximization problems, in Proceedings of the 50th IEEE FOCS, 2009, pp. 251-270.
31. L. Wolsey, An analysis of the greedy algorithm for the submodular set covering problem, Combinatorica, 2 (1982), pp. 385-393.
32. L. Wolsey, Maximizing real-valued submodular functions: Primal and dual heuristics for location problems, Math. Oper. Res., 7 (1982), pp. 410-425.