Optimal approximation for the Submodular Welfare Problem in the value oracle model

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 67-74

  Vondrák, Jan ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

Combinatorial auctions; Matroids; Submodular functions

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; MATRIX ALGEBRA;

ASSIGNMENT PROBLEMS; COMBINATORIAL AUCTION; GENERALIZED ASSIGNMENT PROBLEM; GREEDY ALGORITHMS; MODULAR FUNCTIONS; OPTIMAL APPROXIMATION; SUBMODULAR FUNCTIONS; UTILITY FUNCTIONS;

APPROXIMATION THEORY;

EID: 57049187237     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374389     Document Type: Conference Paper

References (27)

1. A. Ageev and M. Sviridenko. Pipage rounding: a new method of constructing algorithms with proven performance guarantee, J. of Combinatorial Optimizations (2004), 307-328.
2. th IPCO (2007), 182-196.
3. C. Chekuri and A. Kumar. Maximum coverage problem with group budget constraints and applications, Proc. of APPROX 2004, Lecture Notes in Computer Science 3122, 72-83.
4. th SODA (2006), 1064-1073.
5. J. Edmonds. Matroids, submodular functions and certain polyhedra. Combinatorial Structures and Their Applications (1970), 69-87.
6. U. Feige. A threshold of lnra for approximating Set Cover, Journal of the ACM 45 (1998), 634-652.
7. th STOC (2006), 41-50.
8. U. Feige, V. Mirrokni and J. Vondrák. Maximizing non-monotone submodular functions, Proc. of 48th FOCS (2007), 461-471.
9. U. Feige and J. Vondrák. Approximation algorithms for combinatorial allocation problems: Improving the factor of 1 - 1/e, Proc. of 47th FOCS (2006), 667-676.
10. L. Fleischer, S. Fujishige and S. Iwata. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions, Journal of the ACM 48:4 (2001), 761-777.
11. th ACM-SIAM SODA (2006), 611-620.
12. P. Goundan and A. Schulz, Revisiting the greedy approach to submodular set function maximization, manuscript (2007).
13. 1-ε, Acta Mathematica 182 (1999), 105-142.
14. th ACM-SIAM SODA (2004), 204-213.
15. S. Khot, R. Lipton. E. Markakis and A. Mehta. Inapproximability results for combinatorial auctions with submodular utility functions, Proc. of WINE 2005, Lecture Notes in Computer Science 3828, 92-101.
16. B. Lehmann, D. J. Lehmann and N. Nisan. Combinatorial auctions with decreasing marginal utilities, ACM Conference on El. Commerce 2001, 18-28.
17. B. Lehmann, D. J. Lehmann and N. Nisan. Combinatorial auctions with decreasing marginal utilities (journal version), Games and Economic Behavior 55 (2006), 270-296.
18. L. Lovász. Submodular functions and convexity. A. Bachem et al., editors, Mathematical Programmming: The State of the Art, 235-257.
19. V. Mirrokni. M. Schapira and J. Vondrák. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions, manuscript (2007).
20. G. L. Nemhauser, L. A. Wolsey and M. L. Fisher. An analysis of approximations for maximizing submodular set functions I, Mathematical Programming 14 (1978), 265-294.
21. M. L. Fisher, G. L. Nemhauser and L. A. Wolsey. An analysis of approximations for maximizing submodular set functions II, Math. Programming Study 8 (1978), 73-87.
22. G. L. Nemhauser and L. A. Wolsey. Best algorithms for approximating the maximum of a submodular set function, Math. Operations Research 3:3 (1978). 177-188.
23. A. Schrijver. A combinatorial algorithm minimizing submodular functions in strongly polynomial time, Journal of Combinatorial Theory, Series B 80 (2000), 346-355.
24. A. Schrijver. Combinatorial optimization - polyhedra and efficiency. Springer- Verlag Berlin Heidelberg, 2003.
25. M. Sviridenko. A note on maximizing a submodular set function subject to knapsack constraint, Operations Research Letters 32 (2004), 41-43.
26. L. Wolsey. Maximizing real-valued submodular functions: Primal and dual heuristics for location problems. Math. of Operations Research 7 (1982), 410-425.
27. D. Zuckerman. Linear degree extractors and inapproximability, Theory of Computing 3 (2007), 103-128.