Approximation for maximizing monotone non-decreasing set functions with a greedy method

Journal of Combinatorial Optimization

Volumn 31, Issue 1, 2016, Pages 29-43

  Wang, Zengfu ^a,b   Moran, Bill ^b   Wang, Xuezhi ^b   Pan, Quan ^a  

^a NORTHWESTERN POLYTECHNICAL UNIVERSITY   (China)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Approximation algorithm; Matroid; Monotone submodular set function

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; MATRIX ALGEBRA; OPTIMAL SYSTEMS; SET THEORY;

CARDINALITIES; GREEDY ALGORITHMS; MAXIMAL INDEPENDENT SET; MONOTONE SUBMODULAR SET FUNCTIONS; NON-DECREASING FUNCTIONS; OPTIMAL VALUES; OPTIMUM VALUE; SUBMODULAR FUNCTIONS;

APPROXIMATION ALGORITHMS;

EID: 84953639306     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-014-9707-3     Document Type: Article

References (26)

1. Ageev A, Sviridenko M (2004) Pipage rounding: a new method of constructing algorithms with proven performance guarantee. J Comb Optim 8(3):307–328
2. Alimonti P (1994) New local search approximation techniques for maximum generalized satisfiability problems. In: Proceedings of the 2nd Italian conference on algorithms and complexity, pp 40–53
3. Badanidiyuru A, Dobzinski S, Oren S (2011) Optimization with demand oracles. In: Proceedings of the 13th ACM conference on electronic commerce, pp 110–127
4. Buchbinder N, Feldman M, Naor J, Schwartz R (2012) A tight linear time $$(1/2)$$(1/2)-approximation for unconstrained submodular maximization. In: 53rd annual IEEE symposium on foundations of computer science
5. Calinescu G, Chekuri C, Pál M, Vondrák J (2011) Maximizing a submodular set function subject to a matroid constraint. SIAM J Comput 40(6):1740–1766
6. Chakrabarty D, Goel G (2008), On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP. In: Proceedings of the 49th annual IEEE symposium on foundations of computer science, pp 687–696
7. Chekuri C, Vondrák J, Zenklusen R (2011), Submodular function maximization via the multilinear relaxation and contention resolution schemes. In: Proceedings of the 43rd ACM symposium on theory of computing, pp 783–792
8. Conforti M, Cornuéjols G (1984) Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the rado-edmonds theorem. Discrete Appl Math 7(3):251–274
9. Dobzinski S, Schapira M (2006) An improved approximation algorithm for combinatorial auctions with submodular bidders. In: Proceedings of the seventeenth annual ACM-SIAM symposium on discrete algorithm, pp 1064–1073
10. Feige U (1998) A threshold of ln n for approximation set cover. J ACM 45(4):634–652
11. Feige U, Vondrák J (2006), Approximation algorithms for allocation problems: improveing the factor of $$1-\frac{1}{e}$$1-1e. In: Proceedings of 47th annual IEEE symposium on foundations of computer science, pp 667–676
12. Feige U, Vondrák J (1998) The submodular welfare problem with demand queries. Theory Comput 6:247–290
13. Filmus Y, Ward J (2012) A tight combinatorial algorithm for submodular maximization subject to a matroid constraint. In: Proceedings of 53rd annual IEEE symposium on foundations of computer science
14. Fisher ML, Nemhauser GL, Wolsey LA (1978) An analysis of approximations for maximizing submodular set functions - II. Math Progr Study 8:73–87
15. Kempe D, Kleinberg J, Tardos E (2005) Influential nodes in a diffusion model for social networks. In: Proceedings of 32nd international colloquium on automata, languages and programming, Lisboa, Portugal
16. Korte B, Hausmann D (1998) An analysis of the greedy heuritic for independence systems. Ann Discret Math 2:65–74
17. Kulik A, Shachnai H, Tamir T (2009) Maximizing submodular set functions subject to multiple linear constraints. In: Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, pp 545–554
18. Lee J, Mirrokni V S, Nagarajan V, Sviridenko Maxim (2009) Non-monotone submodular maximization under matroid and knapsack constraints. In: Proceedings of the 41st annual ACM symposium on theory of computing, pp 323–332
19. Lee J, Sviridenko M, Vondrák (2010) Submodular maximization over multiple matroids via generalized exchange properties. Math Oper Res 35(4):795–806
20. Lloyd SP, Witsenhausen HS (1986) Weapons allocation is NP-complete. In: Proceedings of the 1986 summer conference on simulation, Reno
21. Lu J, Suda T (2003) Coverage-aware self-scheduling in sensor networks. In: Proceedings of IEEE 18th annual workshop on computer communications, Laguna Niguel
22. Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions-I. Math Progr 14(1):265–294
23. Nembauser GL, Wolsey LA (1978) Best algorithms for approximating the maximum of a submodular set function. Math Oper Res 3(3):177–188
24. Sviridenko M (2004) A note on maximizing a submodular set function subject to a knapsack constraint. Oper Res Lett 32(1):41–43
25. Vondrák J (2008), Optimal approximation for the submodular welfare problem in the value oracle model. In: Proceedings of the 40th annual ACM symposium on theory of computing, pp 67–74
26. Vondrák J (2010) Submodularity and curvature: the optimal algorithm. RIMS Kokyuroku Bessatsu B23:253–266