Fast algorithms for maximizing submodular functions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2014, Pages 1497-1514

  Badanidiyuru, Ashwinkumar ^a   Vondrák, Jan ^b  

^a Cornell University ^*  (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION;

BUILDING BLOCKES; CARDINALITY CONSTRAINTS; CONTINUOUS ALGORITHMS; GREEDY ALGORITHMS; KNAPSACK CONSTRAINTS; LINEAR CONSTRAINTS; OBJECTIVE FUNCTIONS; SUBMODULAR FUNCTIONS;

APPROXIMATION ALGORITHMS;

EID: 84902095946     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973402.110     Document Type: Conference Paper

References (34)

1. Niv Buchbinder, Moran Feldman, Joseph Naor, and Roy Schwartz. A tight linear time (1/2)-approximation for unconstrained submodular maximization. In FOCS, 2012. 2.
2. Gruia Calinescu, Chandra Chekuri, Martin Pal, and Jan Vondrak. Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput., 40(6): 1740-1766, 2011. 2, 3, 4, 5, 16.
3. Chandra Chekuri, Jan Vondrak, and Rico Zenklusen. Submodular function maximization via the multilinear relaxation and contention resolution schemes. In STOC, pages 783-792, 2011. 2, 3, 5, 6.
4. Shahar Dobzinski and Michael Schapira. An improved approximation algorithm for combinatorial auctions with submodular bidders. In SODA, pages 1064-1073, 2006. 1.
5. Devdatt P. Dubhashi and Alessandro Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, 2009. 4.
6. Uriel Feige. On maximizing welfare when utility functions are subadditive. In STOC, pages 41-50, 2006. 1.
7. Uriel Feige, Vahab S. Mirrokni, and Jan Vondrak. Maximizing non-monotone submodular functions. In FOCS, pages 461-471, 2007. 2.
8. Uriel Feige and Jan Vondrak. Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. In FOCS, pages 667-676, 2006. 1.
9. Moran Feldman, Joseph Naor, and Roy Schwartz. Nonmonotone submodular maximization via a structural continuous greedy algorithm - (extended abstract). In ICALP, pages 342-353, 2011. 2.
10. Moran Feldman, Joseph Naor, and Roy Schwartz. A unified continuous greedy algorithm for submodular maximization. In FOCS, pages 570-579, 2011. 2.
11. Yuval Filmus and Justin Ward. A tight combinatorial algorithm for submodular maximization subject to a matroid constraint. CoRR, abs/1204.4526, 2012. 23.
12. M. L. Fisher, G. L. Nemhauser, and L. A. Wolsey. An analysis of approximations for maximizing submodular set functions - II. Math. Prog. Study, 8:73-87, 1978. 1, 2, 3.
13. Shayan Oveis Gharan and Jan Vondrak. Submodular maximization by simulated annealing. In SODA, pages 1098-1116, 2011. 2.
14. Carlos Guestrin, Andreas Krause, and Ajit Paul Singh. Near-optimal sensor placements in gaussian processes. In ICML, pages 265-272, 2005. 1.
15. Anupam Gupta, Viswanath Nagarajan, and R. Ravi. Robust and maxmin optimization under matroid and knapsack uncertainty sets. CoRR, abs/1012.4962, 2010. 2.
16. Anupam Gupta, Aaron Roth, Grant Schoenebeck, and Kunal Talwar. Constrained non-monotone submodular maximization: Offline and secretary algorithms. In WINE, pages 246-257, 2010. 2.
17. David Kempe, Jon M. Kleinberg, and Eva Tardos. Maximizing the spread of influence through a social network. In KDD, pages 137-146, 2003. 1.
18. David Kempe, Jon M. Kleinberg, and Eva Tardos. Influential nodes in a diffusion model for social networks. In ICALP, pages 1127-1138, 2005. 1.
19. Samir Khuller, Anna Moss, and Joseph Naor. The budgeted maximum coverage problem. Inf. Process. Lett., 70(1):39-45, 1999. 8.
20. Andreas Krause and Carlos Guestrin. Submodularity and its applications in optimized information gathering. ACM TIST, 2(4):32, 2011. 1.
21. Andreas Krause, Carlos Guestrin, Anupam Gupta, and Jon M. Kleinberg. Near-optimal sensor placements: Maximizing information while minimizing communication cost. In IPSN, pages 2-10, 2006. 1.
22. Andreas Krause, Carlos Guestrin, Anupam Gupta, and Jon M. Kleinberg. Robust sensor placements at informative and communication-efficient locations. TOSN, 7(4) :31, 2011. 1.
23. Andreas Krause, Ajit Paul Singh, and Carlos Guestrin. Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies. Journal of Machine Learning Research, 9:235-284, 2008. 1, 2.
24. Ariel Kulik, Hadas Shachnai, and Tami Tamil-. Maximizing submodular set functions subject to multiple linear constraints. In SODA, pages 545-554, 2009. 2, 3.
25. Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, and Maxim Sviridenko. Non-monotone submodular maximization under matroid and knapsack constraints. In STOC, pages 323-332, 2009. 2.
26. Jon Lee, Maxim Sviridenko, and Jan Vondrak. Matroid matching: The power of local search. In STOC, pages 369-378, 2010. 2, 4.
27. Benny Lehmann, Daniel J. Lehmann, and Noam Nisan. Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior, 55(2):270-296, 2006. 1.
28. Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne M. VanBriesen, and Natalie S. Glance. Cost-effective outbreak detection in networks. In KDD, pages 420-429, 2007. 1, 2.
29. G. L. Nemhauser and L. A. Wolsey. Best algorithms for approximating the maximum of a submodular set functions. Math. Oper. Research, 3(3):177-188, 1978. 1.
30. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions - I. Math. Prog., 14:265-294, 1978. 1, 3.
31. Alexander Schrijver. Combinatorial Optimization, Volume B. Springer, 2003. 1.
32. Maxim Sviridenko. A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett., 32(1):41-43, 2004. 2, 3, 8.
33. Jan Vondrak. Optimal approximation for the submodular welfare problem in the value oracle model. In STOC, pages 67-74, 2008. 1, 2, 3, 5.
34. Jan Vondrak. Symmetry and approximability of sub- modular maximization problems. In FOCS, pages 651- 670. 2009. 2.