Approximations for monotone and nonmonotone submodular maximization with knapsack constraints

Mathematics of Operations Research

Volumn 38, Issue 4, 2013, Pages 729-739

  Kulik, Ariel ^a   Shachnai, Hadas ^a   Tamir, Tami ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b INTERDISCIPLINARY CENTER   (Israel)

Author keywords

Approximation algorithms; Generalized assignment problem; Knapsack constraints; Maximum coverage; Randomization; Submodular maximization

Indexed keywords

GENERALIZED ASSIGNMENT PROBLEM; KNAPSACK CONSTRAINTS; MAXIMUM COVERAGE; RANDOMIZATION; SUBMODULAR;

COMBINATORIAL OPTIMIZATION; OPTIMIZATION; POLYNOMIALS;

APPROXIMATION ALGORITHMS;

EID: 84891855975     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.2013.0592     Document Type: Article

References (27)

1. Ageev AA, Sviridenko M (2004) Pipage rounding: A new method of constructing algorithms with proven performance guarantee. J. Combin. Optim. 8(3):307-328.
2. Bansal N, Korula N, Nagarajan V, Srinivasan A (2010) On k-column sparse packing programs. Proc. 14th Internat. Conf. Integer Programming Combin. Optim. (Springer, Berlin, Heidelberg), 369-382.
3. Calinescu G, Chekuri C, Pál M, Vondrák J (2007) Maximizing a submodular set function subject to a matroid constraint (extended abstract). Proc. 12th Internat. Conf. Integer Programming Combin. Optim. (Springer, Berlin, Heidelberg), 182-196.
4. Calinescu G, Chekuri C, Pál M, Vondrák J (2011) Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6):1740-1766.
5. Chekuri C, Kumar A (2004) Maximum coverage problem with group budget constraints and applications. Proc. APPROX-RANDOM (Springer, Berlin, Heidelberg), 72-83.
6. Chekuri C, Vondrák J, Zenklusen R (2010) Dependent randomized rounding via exchange properties of combinatorial structures. Proc. 2010 IEEE 51st Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 575-584.
7. Demaine ED, Zadimoghaddam M (2010) Scheduling to minimize power consumption using submodular functions. Proc. 22nd ACM Sympos. Parallelism in Algorithms and Architectures (ACM, New York), 21-29.
8. Fadaei S, Mohammad Ali S, Mohammad Amin F (2011) Maximizing submodular set functions subject to different constraints: Combined algorithms. CoRR abs/1101.2973.
9. Feige U (1998) A threshold of ln n for approximating set cover. J. ACM 45(4):634-652. (Pubitemid 128488790)
10. Feige U, Mirrokni VS, Vondrák J (2007) Maximizing nonmonotone submodular functions. Proc. 48th Annual IEEE Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 461-471.
11. Feldman M, Naor J, Schwartz R (2011) A unified continuous greedy algorithm for submodular maximization. Proc. 2011 IEEE 52nd Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 570-579.
12. Fujito T (2000) Approximation algorithms for submodular set cover with applications. IEICE Trans. Inf. Systems E83-D(3), 480-487.
13. Gharan SO, Vondrák J (2011) Submodular maximization by simulated annealing. Proc. Twenty-Second Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1098-1116.
14. Hartline J, Mirrokni V, Sundararajan M (2008) Optimal marketing strategies over social networks. Proc. 17th Internat. Conf. World Wide Web (ACM, New York), 189-198.
15. Kellerer H, Pferschy U, Pisinger D (2004) Knapsack Problems, 1st ed. (Springer, Berlin).
16. Khuller S, Moss A, Naor J (1999) The budgeted maximum coverage problem. Inf. Process. Lett. 70(1):39-45.
17. Kulik A (2011) Submodular and Linear Maximization with Knapsack Constraints. M.Sc. thesis, Computer Science Department, Technion, Haifa, Israel.
18. Kulik A, Shachnai H (2010) There is no EPTAS for two-dimensional knapsack. Inf. Process. Lett. 110(16):707-710.
19. Kulik A, Shachnai H, Tamir T (2009) Maximizing submodular set functions subject to multiple linear constraints. Proc. 20th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 545-554.
20. Lee J, Mirrokni VS, Nagarajan V, Sviridenko M (2009) Nonmonotone submodular maximization under matroid and knapsack constraints. Proc. 41st Annual ACM Sympos. Theory Comput. (ACM, New York), 323-332.
21. Magazine MJ, Chern M-S (1984) A note on approximation schemes for multidimensional knapsack problems. Math. Oper. Res. 9(2):244-247.
22. Nemhauser G, Wolsey L (1978) Best algorithms for approximating the maximum of a submodular set function. Math. Oper. Res. 3(3):177-188.
23. Nemhauser G, Wolsey L, Fisher M (1978) An analysis of the approximations for maximizing submodular set functions. Math. Programming 14:265-294.
24. Schrijver A (2003) Combinatorial Optimization-Polyhedra and Efficiency (Springer-Verlag, Berlin, Heidelberg).
25. Sviridenko M (2004) A note on maximizing a submodular set function subject to knapsack constraint. Oper. Res. Lett. 32:41-43.
26. Vondrák J (2008) Optimal approximation for the submodular welfare problem in the value oracle model. Proc. 40th Annual ACM Sympos. Theory Comput. (ACM, New York), 67-74.
27. Vondrák J, Chekuri C, Zenklusen R (2011) Submodular function maximization via the multilinear relaxation and contention resolution schemes. Proc. 43rd Annual ACM Sympos. Theory Comput. (ACM, New York), 783-792.