A tight combinatorial algorithm for submodular maximization subject to a matroid constraint

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

Volumn , Issue , 2012, Pages 659-668

  Filmus, Yuval ^a   Ward, Justin ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

approximation algorithms; local search; matroids; submodular functions

Indexed keywords

APPROXIMATION RATIOS; COMBINATORIAL ALGORITHM; GREEDY ALGORITHMS; LOCAL SEARCH; MAXIMUM COVERAGE; MODULAR FUNCTIONS; OBJECTIVE FUNCTIONS; PADE APPROXIMANTS; POTENTIAL FUNCTION; SUBMODULAR; SUBMODULAR FUNCTIONS;

APPROXIMATION ALGORITHMS; COMPUTER SCIENCE; MATRIX ALGEBRA; OPTIMIZATION;

COMBINATORIAL MATHEMATICS;

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

References (31)

1. A. A. Ageev and M. I. Sviridenko, "Pipage rounding: A new method of constructing algorithms with proven performance guarantee," J. of Combinatorial Optimization, vol. 8, no. 3, pp. 307-328, Sep. 2004.
2. P. Alimonti, "New local search approximation techniques for maximum generalized satisfiability problems," in CIAC, 1994, pp. 40-53.
3. G. A. Baker and P. Graves-Morris, Padé Approximants, 2nd ed., ser. Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1996, no. 59.
4. R. A. Brualdi, "Comments on bases in dependence structures," Bull. of the Austral. Math. Soc., vol. 1, no. 02, pp. 161-167, 1969.
5. N. Buchbinder, M. Feldman, J. S. Naor, and R. Schwartz, "A tight linear time (1/2)-approximation for unconstrained submodular maximization," in FOCS, 2012.
6. G. Calinescu, C. Chekuri, M. Pál, and J. Vondrák, "Maximizing a submodular set function subject to a matroid constraint (Extended abstract)," in IPCO, 2007, pp. 182-196.
7. -, "Maximizing a monotone submodular function subject to a matroid constraint," SIAM J. Comput., vol. 40, no. 6, pp. 1740-1766, 2011.
8. C. Chekuri, J. Vondrak, and R. Zenklusen, "Dependent randomized rounding via exchange properties of combinatorial structures," FOCS, pp. 575-584, 2010.
9. J. Edmonds, "Matroids and the greedy algorithm," Math. Programming, vol. 1, no. 1, pp. 127-136, 1971.
10. U. Feige, "A threshold of ln n for approximating set cover," J. ACM, vol. 45, pp. 634-652, Jul. 1998.
11. U. Feige, V. S. Mirrokni, and J. Vondrak, "Maximizing nonmonotone submodular functions," in FOCS, 2007, pp. 461-471.
12. M. Feldman, J. Naor, and R. Schwartz, "A unified continuous greedy algorithm for submodular maximization," in FOCS, 2011, pp. 570-579.
13. M. Feldman, J. S. Naor, and R. Schwartz, "Nonmonotone submodular maximization via a structural continuous greedy algorithm," in ICALP, 2011, pp. 342-353.
14. M. Feldman, J. S. Naor, R. Schwartz, and J. Ward, "Improved approximations for k-exchange systems," in ESA, 2011, pp. 784-798.
15. Y. Filmus and J. Ward, "The power of local search: Maximum coverage over a matroid," in STACS, 2012, pp. 601-612.
16. -, "A tight combinatorial algorithm for submodular maximization subject to a matroid constraint," Preprint, 2012, arXiv:1204.4526.
17. M. L. Fisher, G. L. Nemhauser, and L. A. Wolsey, "An analysis of approximations for maximizing submodular set functions - II," in Polyhedral Combinatorics. Springer Berlin Heidelberg, 1978, pp. 73-87.
18. S. O. Gharan and J. Vondrák, "Submodular maximization by simulated annealing," in SODA, 2011, pp. 1098-1116.
19. P. R. Goundan and A. S. Schulz, "Revisiting the greedy approach to submodular set function maximization," 2007, (manuscript).
20. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani, "On syntactic versus computational views of approximability," SIAM J. Comput., vol. 28, no. 1, pp. 164-191, 1999.
21. S. Khuller, A. Moss, and J. S. Naor, "The budgeted maximum coverage problem," Inf. Process. Lett., vol. 70, pp. 39-45, April 1999.
22. J. Lee, V. S. Mirrokni, V. Nagarajan, and M. Sviridenko, "Non-monotone submodular maximization under matroid and knapsack constraints," in STOC, 2009, pp. 323-332.
23. J. Lee, M. Sviridenko, and J. Vondrák, "Submodular maximization over multiple matroids via generalized exchange properties," Math. of Oper. Res., vol. 35, no. 4, pp. 795-806, Nov. 2010.
24. G. L. Nemhauser and L. A. Wolsey, "Best algorithms for approximating the maximum of a submodular set function," Math. of Operations Res., vol. 3, no. 3, pp. 177-188, 1978.
25. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, "An analysis of approximations for maximizing submodular set functions - I," Math. Programming, vol. 14, no. 1, pp. 265-294, 1978.
26. H. Padé, "Sur la représentation approchée d'une fonction par des fractions rationnelles," Annales scientifiques de l'École Normale Supérieure, Ser. 3, vol. 9, pp. 3-93 (supplement), 1892.
27. R. Rado, "Note on independence functions," Proc. of the London Math. Soc., vol. s3-7, no. 1, pp. 300-320, 1957.
28. C. Underhill and A. Wragg, "Convergence properties of padé approximants to exp(z) and their derivatives," IMA J. of Applied Math., vol. 11, no. 3, pp. 361-367, 1973.
29. J. Vondrák, "Optimal approximation for the submodular welfare problem in the value oracle model," in STOC, 2008, pp. 67-74.
30. -, "Submodularity and curvature: the optimal algorithm," in RIMS Kokyuroku Bessatsu, S. Iwata, Ed., vol. B23, Kyoto, 2010.
31. J. Ward, "A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems," in STACS, 2012, pp. 42-53.