Optimal approximation for submodular and supermodular optimization with bounded curvature

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 2015-January, Issue January, 2015, Pages 1134-1148

  Sviridenko, Maxim ^a   Vondrak, Jan ^b   Ward, Justin ^c  

^a YAHOO RESEARCH   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; CURVE FITTING; OPTIMIZATION;

APPROXIMATION RESULTS; CARDINALITY CONSTRAINTS; CONCRETE APPLICATIONS; MAXIMUM ENTROPY SAMPLING; OBJECTIVE FUNCTIONS; OPTIMAL APPROXIMATION; SUBMODULAR FUNCTIONS; SUPERMODULAR FUNCTIONS;

APPROXIMATION ALGORITHMS;

EID: 84938260325     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973730.76     Document Type: Conference Paper

References (34)

1. Alexander Ageev and Maxim Sviridenko. Pipage rounding: A new method of constructing algorithms with proven performance guarantee. J. Combinatorial Optimization, 8 (3): 307-328, 2004.
2. Christos Boutsidis, Petros Drineas, and Malik Magdon-Ismail. Near-optimal column-based matrix reconstruction. SI AM J. Comput., 43 (2): 687-717, 2014.
3. Richard A Brualdi. Comments on bases in dependence structures. Bull, of the Australian Math. Soc. 1 (02): 161-167, 1969.
4. Gruia Calinescu, Chandra Chekuri, Martin Pal, and Jan Vondrak. Maximizing a submodular set function subject to a matroid constraint (extended abstract). In Proc. 12th IPCO, pages 182-196, 2007.
5. Gruia Calinescu, Chandra Chekuri, Martin Pal, and Jan Vondrak. Maximizing a submodular set function subject to a matroid constraint. SI AM J. Comput., 40 (6): 1740-1766, 2011.
6. Chandra Chekuri, Jan Vondrak, and Rico Zenklusen. Dependent randomized rounding via exchange properties of combinatorial structures. In Proc. 51st FOCS, pages 575-584, 2010.
7. Chandra Chekuri, Jan Vondrak, and Rico Zenklusen. Multi-budgeted matchings and matroid intersection via dependent rounding. In Proc. 22nd SODA, pages 1080-1097, 2011.
8. Chandra Chekuri, Jan Vondrak, and Rico Zenklusen. Submodular function maximization via the multilinear relaxation and contention resolution schemes. In Proc. 43rd STOC, pages 783-792, 2011.
9. Michele Conforti and Gerard Cornuejols. Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the rado-edmonds theorem. Discrete Applied Mathematics, 7 (3): 251-274, 1984.
10. Amit Deshpande and Luis Rademacher. Efficient volume sampling for row/column subset selection. In Proc. 51st FOCS, pages 329-338, 2010.
11. Amit Deshpande and Santosh Vempala. Adaptive sampling and fast low-rank matrix approximation. In Proc. 9th APPROX, pages 292-303. Springer, 2006.
12. S. Dobzinski, N. Nisan, and M. Schapira. Approximation algorithms for combinatorial auctions with complement-free bidders. In Proc. 37th STOC, pages 610-618, 2005.
13. Shahar Dobzinski and Jan Vondrak. From query complexity to computational complexity. In Proc. 44th STOC pages 1107-1116, 2012.
14. Jack Edmonds. Matroids and the greedy algorithm. Mathematical Programming, 1 (1): 127-136, 1971.
15. Uriel Feige. A threshold of In n for approximating set cover. J. ACM, 45:634-652, 1998.
16. Yuval Filmus and Justin Ward. A tight combinatorial algorithm for submodular maximization subject to a matroid constraint. In Proc. 53nd FOCS, 2012.
17. Yuval Filmus and Justin Ward. Monotone submodular maximization over a matroid via non-oblivious local search. SI AM J. Comput, 43 (2): 514-542, 2014.
18. M.L. Fisher, G.L. Nemhauser, and L.A. Wolsey. An analysis of approximations for maximizing submodular set functions-II. Mathematical Programming Studies, 8:73-87, 1978.
19. Victor P. Il'ev. An approximation guarantee of the greedy descent algorithm for minimizing a supermodu-lar set function. Discrete Applied Mathematics, 114 (1-3): 131-146, October 2001.
20. A.K. Kelmans. Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows. Discrete Mathematics, 44 (1): 113-116, 1983.
21. David Kempe, Jon M. Kleinberg, and Eva Tardos. Maximizing the spread of influence through a social network. In Proc. 9th KDD, pages 137-146, 2003.
22. C.W. Ko, Jon Lee, and Maurice Queyranne. An exact algorithm for maximum entropy sampling. Operations Research, 43 (4) =684-691, 1996.
23. A. Krause and C. Guestrin. Submodularity and its applications in optimized information gathering. A CM Trans, on Intelligent Systems and Technology, 2 (4)=32, 2011.
24. A. Krause, C. Guestrin, A. Gupta, and J. Kleinberg. Near-optimal sensor placements: maximizing information while minimizing communication cost. In Proc. 5th IPSN, pages 2-10, 2006.
25. A. Krause, A. Singh, and C. Guestrin. Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies. J. Machine Learning Research, 9:235-284, 2008.
26. Andreas Krause, Ram Rajagopal, Anupam Gupta, and Carlos Guestrin. Simultaneous placement and scheduling of sensors. In Proc. 8th IPSN, pages 181-192, 2009.
27. Jon Lee. Maximum entropy sampling. Encyclopedia of Environmetrics, 3:1229-1234, 2002.
28. B. Lehmann, D. J. Lehmann, and N. Nisan. Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior, 55:1884-1899, 2006.
29. G.L. Nemhauser and L.A. Wolsey. Best algorithms for approximating the maximum of a submodular set function. Mathematics of Operations Research, 3 (3): 177-188, 1978.
30. G.L. Nemhauser, L.A. Wolsey, and M.L. Fisher. An analysis of approximations for maximizing submodular set functions-I. Mathematical Programming, 14 (1): 265-294, 1978.
31. Alexander Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2003.
32. Jan Vondrak. Optimal approximation for the submodular welfare problem in the value oracle model. In Proc. 40th STOC, pages 67-74, 2008.
33. Jan Vondrak. Symmetry and approximability of sub-modular maximization problems. In Proc. 50th FOCS, pages 651-670, 2009.
34. Jan Vondrak. Submodularity and curvature: the optimal algorithm. In RIMS Kokyuroku Bessatsu, volume B23, pages 253-266, Kyoto, 2010.