Submodular function maximization via the multilinear relaxation and contention resolution schemes

SIAM Journal on Computing

Volumn 43, Issue 6, 2014, Pages 1831-1879

  Chekuri, Chandra ^a   Vondrák, Jan ^b   Zenklusen, Rico ^c,d  

^a University of Illinois at Urbana Champaign   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c ETH ZURICH   (Switzerland)

^d Johns Hopkins University   (United States)

Author keywords

Approximation algorithms; Contention resolution; Randomized algorithms; Submodular function maximization

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; LINEAR PROGRAMMING;

CONSTANT-FACTOR APPROXIMATION ALGORITHMS; CONTENTION RESOLUTION; KNAPSACK CONSTRAINTS; LINEAR PROGRAMMING DUALITY; MULTILINEAR EXTENSION; RANDOMIZED ALGORITHMS; SUBMODULAR FUNCTIONS; SUBMODULAR SET FUNCTIONS;

APPROXIMATION ALGORITHMS;

EID: 84920742613     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/110839655     Document Type: Article

References (49)

1. A. AGEEV AND M. SVIRIDENKO, Pipage rounding: A new method of constructing algorithms with proven performance guarantee, J. Comb. Optim., 8 (2004), pp. 307-328.
2. S. AGRAWAL, Y. DING, A. SABERI, AND Y. YE, Price of correlations in stochastic optimization, Oper. Res., 60 (2012), pp. 150-162.
3. N. ALON AND J. SPENCER, The Probabilistic Method, 3rd ed., John Wiley & Sons, Hoboken, NJ, 2008.
4. N. BANSAL, N. KORULA, V. NAGARAJAN, AND A. SRINIVASAN, Solving packing integer programs via randomized rounding with alterations, Theory Comput., 8 (2012), pp. 533-565.
5. G. CALINESCU, A. CHAKRABARTI, H. KARLOFF, AND Y. RABANI, An improved approximation algorithm for resource allocation, ACM Trans. Algorithms, 7 (2011), 48.
6. G. CALINESCU, C. CHEKURI, M. PÁL, AND J. VONDRA[[AMPI]]ACUTE;K, Maximizing a submodular set function subject to a matroid constraint, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 4513, Springer, Berlin, 2007, pp. 182-196.
7. G. CALINESCU, C. CHEKURI, M. PÁL, AND J. VONDRÁK, Maximizing a monotone submodular function subject to a matroid constraint, SIAM J. Comput., 40 (2011), pp. 1740-1766.
8. A. CHAKRABARTI, C. CHEKURI, A. GUPTA, AND A. KUMAR, Approximation algorithms for the unsplittable flow problem, Algorithmica, 47 (2007), pp. 53-78.
9. T. CHAN AND S. HAR-PELED, Approximation algorithms for maximum independent set of pseudo-disks, Discrete Comput. Geom., 48 (2012), pp. 373-392.
10. A. K. CHANDRA, D. S. HIRSCHBERG, AND C. K. WONG, Approximate algorithms for some generalized knapsack problems, Theoret. Comput. Sci., 3 (1976), pp. 293-304.
11. S. CHAWLA, J. HARTLINE, D. MALEC, AND B. SIVAN, Sequential Posted Pricing and Multi-Parameter Mechanism Design, preprint, arXiv:0907.2435v1 [cs.GT], 2009.
12. S. CHAWLA, J. HARTLINE, D. MALEC, AND B. SIVAN, Multi-parameter mechanism design and sequential posted pricing, in Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010, pp. 311-320.
13. C. CHEKURI, A. ENE, AND N. KORULA, Unsplittable flow in paths and trees and columnrestricted packing integer programs, in Proceedings of the 12th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Springer-Verlag, Berlin, Heidelberg, 2009, pp. 42-55.
14. C. CHEKURI, M. MYDLARZ, AND F. B. SHEPHERD, Multicommodity demand flow in a tree and packing integer programs, ACM Trans. Algorithms, 3 (2007), 27.
15. C. CHEKURI, J. VONDRÁK, AND R. ZENKLUSEN, Dependent randomized rounding via exchange properties of combinatorial structures, in Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, 2010, pp. 575-584.
16. C. CHEKURI, J. VONDRÁK, AND R. ZENKLUSEN, Submodular function maximization via the multilinear relaxation and contention resolution schemes, in Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, 2011, pp. 783-792.
17. G. CORNUEJOLS, M. L. FISHER, AND G. NEMHAUSER, Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms, Management Sci., 23 (1977), pp. 789-810.
18. A. ENE, S. HAR-PELED, AND B. RAICHEL, Geometric packing under non-uniform constraints, in Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry, ACM, New York, 2012, pp. 11-20.
19. U. FEIGE, A threshold of ln n for approximating set cover, J. ACM, 45 (1998), pp. 634-652.
20. U. FEIGE, V. S. MIRROKNI, AND J. VONDRÁK, Maximizing non-monotone submodular functions, SIAM J. Comput., 40 (2011), pp. 1133-1153.
21. U. FEIGE AND J. VONDRÁK, Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e, in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006, pp. 667-676.
22. U. FEIGE AND J. VONDRÁK, The submodular welfare problem with demand queries, Theory Comput., 6 (2010), pp. 247-290.
23. M. FELDMAN, J. NAOR, AND R. SCHWARTZ, A unified continuous greedy algorithm for submodular maximization, in Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science, 2011, pp. 570-579.
24. M. L. FISHER, G. L. NEMHAUSER, AND L. A. WOLSEY, An analysis of approximations for maximizing submodular set functions. II. Polyhedral combinatorics, Math. Programming Stud., no. 8 (1978), pp. 73-87.
25. A. M. FRIEZE AND M. R. B. CLARKE, Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses, European J. Oper. Res., 15 (1984), pp. 100-109.
26. N. GARG, V. V. VAZIRANI, AND M. YANNAKAKIS, Primal-dual approximation algorithms for integral flow and multicut in trees, Algorithmica, 18 (1997), pp. 3-20.
27. A. GUPTA, V. NAGARAJAN, AND R. RAVI, Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets, preprint, arXiv:1012.4962v2 [cs.DS], 2011.
28. A. GUPTA, A. ROTH, G. SCHOENEBECK, AND K. TALWAR, Constrained non-monotone submodular maximization: Offline and secretary algorithms, in Proceedings of the 6th International Conference on Internet and Network Economics, Springer-Verlag, Berlin, Heidelberg, 2010.
29. A. GUPTA, A. ROTH, G. SCHOENEBECK, AND K. TALWAR, Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms, preprint, arXiv:1003.1517v2 [cs.DS], 2010.
30. 1-ε, Acta Math., 182 (1999), pp. 105-142.
31. S. G. KOLLIOPOULOS AND C. STEIN, Approximating disjoint-path problems using packing integer programs, Math. Program., 99 (2004), pp. 63-87.
32. B. KORTE AND J. VYGEN, Combinatorial Optimization: Theory and Algorithms, Springer, Heidelberg, 2012.
33. A. KULIK, H. SHACHNAI, AND T. TAMIR, Maximizing submodular set functions subject to multiple linear constraints, in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2009, pp. 545-554.
34. A. KULIK, H. SHACHNAI, AND T. TAMIR, Approximations for monotone and nonmonotone submodular maximization with knapsack constraints, Math. Oper. Res., 38 (2013), pp. 729-739.
35. J. LEE, V. S. MIRROKNI, V. NAGARAJAN, AND M. SVIRIDENKO, Maximizing nonmonotone submodular functions under matroid and knapsack constraints, SIAM J. Discrete Math., 23 (2010), pp. 2053-2078.
36. J. LEE, M. SVIRIDENKO, AND J. VONDRÁK, Submodular maximization over multiple matroids via generalized exchange properties, Math. Oper. Res., 35 (2010), pp. 795-806.
37. J. LEE, M. SVIRIDENKO, AND J. VONDRÁK, Matroid matching: The power of local search, SIAM J. Comput., 42 (2013), pp. 357-379.
38. L. LOVÁSZ, Submodular functions and convexity, in Mathematical Programming: The State of the Art (Bonn 1982), Springer, Berlin, 1983, pp. 235-257.
39. V. MIRROKNI, M. SCHAPIRA, AND J. VONDRÁK, Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions, in Proceedings of the 9th ACM Conference on Electronic Commerce, 2008, pp. 70-77.
40. 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.
41. G. L. NEMHAUSER, L. A. WOLSEY, AND M. L. FISHER, An analysis of approximations for maximizing submodular set functions. I, Math. Programming, 14 (1978), pp. 265-294.
42. S. OVEIS GHARAN AND J. VONDRÁK, Submodular maximization by simulated annealing, in Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2011, pp. 1098-1116.
43. A. SRINIVASAN, New approaches to covering and packing problems, in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, AMC, New York, SIAM, Philadelphia, 2001, pp. 567-576.
44. M. SVIRIDENKO, A note on maximizing a submodular set function subject to knapsack constraint, Oper. Res. Lett., 32 (2004), pp. 41-43.
45. J. VONDRÁK, Submodularity in Combinatorial Optimization, Ph.D. thesis, Department of Applied Mathematics, Charles University, Prague, Czech Republic, 2007.
46. J. VONDRÁK, Optimal approximation for the submodular welfare problem in the value oracle model, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008, pp. 67-74.
47. J. VONDRÁK, A Note on Concentration of Submodular Functions, preprint, arXiv:1005.2791v1 [cs.DM], 2010.
48. J. VONDRÁK, Symmetry and approximability of submodular maximization problems, SIAM J. Comput., 42 (2013), pp. 265-304.
49. Q. YAN, Mechanism design via correlation gap, in Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2011, pp. 710-719.