Efficient submodular function maximization under linear packing constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7391 LNCS, Issue PART 1, 2012, Pages 38-50

  Azar, Yossi ^a   Gamzu, Iftah ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; CHARACTERISTIC VECTORS; COMBINATORIAL ALGORITHM; CONSTANT FACTOR APPROXIMATION; PACKING CONSTRAINTS; PACKING INTEGER PROGRAMS; PERFORMANCE GUARANTEES; SUBMODULAR FUNCTIONS;

APPROXIMATION ALGORITHMS; AUTOMATA THEORY; COMBINATORIAL MATHEMATICS; INTEGER PROGRAMMING; SET THEORY;

MATRIX ALGEBRA;

EID: 84883794517     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31594-7_4     Document Type: Conference Paper

References (31)

1. Ageev, A.A., Sviridenko, M.: Pipage rounding: A new method of constructing algorithms with proven performance guarantee. J. Comb. Optim. 8(3), 307-328 (2004)
2. Azar, Y., Regev, O.: Combinatorial algorithms for the unsplittable flow problem. Algorithmica 44(1), 49-66 (2006)
3. Bansal, N., Korula, N., Nagarajan, V., Srinivasan, A.: On k-Column Sparse Packing Programs. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 369-382. Springer, Heidelberg (2010)
4. Briest, P., Krysta, P., Vöcking, B.: Approximation techniques for utilitarian mechanism design. In: 37th STOC, pp. 39-48 (2005)
5. Calinescu, G., Chekuri, C., Pál, M., Vondrák, J.: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 182-196. Springer, Heidelberg (2007)
6. Chekuri, C., Khanna, S.: On multidimensional packing problems. SIAM J. Comput. 33(4), 837-851 (2004)
7. Chekuri, C., Vondrák, J.: Personal Communication (2010)
8. Chekuri, C., Vondrák, J., Zenklusen, R.: Dependent randomized rounding via exchange properties of combinatorial structures. In: 51st FOCS, pp. 575-584 (2010)
9. Chekuri, C., Vondrák, J., Zenklusen, R.: Submodular function maximization via the multi-linear relaxation and contention resolution schemes. In: 43rd STOC, pp. 783-792 (2011)
10. Dobzinski, S., Vondrák, J.: From query complexity to computational complexity. In: 44th STOC (2012)
11. Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634-652 (1998)
12. Feige, U., Mirrokni, V.S., Vondrák, J.: Maximizing non-monotone submodular functions. In: 48th FOCS, pp. 461-471 (2007)
13. Feldman, M., Naor, J(S.), Schwartz, R.: Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (Extended Abstract). In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011 Part I. LNCS, vol. 6755, pp. 342-353. Springer, Heidelberg (2011)
14. Feldman, M., Naor, J., Schwartz, R.: A unified continuous greedy algorithm for submodular maximization. In: 52nd FOCS, pp. 570-579 (2011)
15. Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An analysis of approximations for maximizing submodular set functions II. Math. Program. Study 8, 73-87 (1978)
16. Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput. 37(2), 630-652 (2007)
17. Gharan, S.O., Vondrák, J.: Submodular maximization by simulated annealing. In: 22nd SODA, pp. 1098-1116 (2011)
18. Goundan, P.R., Schulz, A.S.: Revisiting the greedy approach to submodular set function maximization (2007) (manuscript)
19. Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39-45 (1999)
20. Kulik, A., Shachnai, H., Tamir, T.: Maximizing submodular set functions subject to multiple linear constraints. In: 20th SODA, pp. 545-554 (2009)
21. Lee, J., Mirrokni, V.S., Nagarajan, V., Sviridenko, M.: Maximizing nonmonotone submodular functions under matroid or knapsack constraints. SIAM J. Discrete Math. 23(4), 2053-2078 (2010)
22. Nemhauser, G.L., Wolsey, L.A.: Best algorithms for approximating the maximum of a submodular set function. Math. Operations Research 3(3), 177-188 (1978)
23. Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions I . Math. Program. 14, 265-294 (1978)
24. Raghavan, P.: Probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences 37(2), 130-143 (1988)
25. Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4), 365-374 (1987)
26. Srinivasan, A.: Improved approximation guarantees for packing and covering integer programs. SIAM J. Comput. 29(2), 648-670 (1999)
27. Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32(1), 41-43 (2004)
28. Vondrák, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: 40th STOC, pp. 67-74 (2008)
29. Vondrák, J.: Symmetry and approximability of submodular maximization problems. In: 50th FOCS, pp. 651-670 (2009)
30. Wolsey, L.A.: Maximising real-valued submodular functions: Primal and dual heuristics for location problems. Math. Operations Research 7(3), 410-425 (1982)
31. Young, N.E.: Randomized rounding without solving the linear program. In: 6th SODA, pp. 170-178 (1995)