Maximizing a monotone submodular function subject to a matroid constraint

SIAM Journal on Computing

Volumn 40, Issue 6, 2011, Pages 1740-1766

  Calinescu, Gruia ^a   Chekuri, Chandra ^b   Pál, Martin ^c   Vondrák, Jan ^d  

^a Illinois Institute of Technology   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c GOOGLE INC   (United States)

^d IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Approximation algorithm; Generalized assignment problem; Matroid; Monotone submodular set function; Social welfare

Indexed keywords

A-MONOTONE; BLACK BOXES; GENERAL CONSTRAINTS; GENERALIZED ASSIGNMENT PROBLEM; GREEDY ALGORITHMS; OPTIMAL APPROXIMATION; ORACLE MODEL; PROBLEM SIZE; SET FUNCTION; SOCIAL WELFARE; SUBMODULAR; SUBMODULAR FUNCTIONS;

COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; MATRIX ALGEBRA; OPTIMIZATION; SET THEORY;

APPROXIMATION ALGORITHMS;

EID: 84855599508     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080733991     Document Type: Conference Paper

References (44)

1. A. AGEEV AND M. SVIRIDENKO, Pipage rounding: A new method of constructing algorithms with proven performance guarantee, J. Combin. Optim., 8(2004), pp. 307-328.
2. N. ALON AND J. H. SPENCER, The Probabilistic Method, 2nd ed., Wiley Interscience, New York, 2000.
3. G. CALINESCU, C. CHEKURI, M. PÁL, AND J. VONDRÁK, Maximizing a submodular set function subject to a matroid constraint, in Proceedings of the 12th IPCO Conference, 2007, pp. 182-196.
4. G. CALINESCU, C. G. FERNANDES, H. KARLOFF, AND A. ZELIKOVSKI, A new approximation algorithm for finding heavy planar subgraphs, Algorithmica, 36(2003), pp. 179-205.
5. D. CHAKRABARTY AND G. GOEL, 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, 2008, pp. 687-696.
6. C. CHEKURI AND S. KHANNA, A polynomial time approximation scheme for the multiple knapsack problem, SIAM J. Comput., 35(2006), pp. 713-728.
7. C. CHEKURI AND A. KUMAR, Maximum coverage problem with group budget constraints and applications, in Approximation, Randomization, and Combinatorial Optimization, Lecture Notes in Comput. Sci. 3122, Springer, Berlin, 2004, pp. 72-83.
8. C. CHEKURI AND M. PÁL, A recursive greedy algorithm for walks in directed graphs, in Proceedings of the 46th Annual Symposium on Foundations of Computer Science, 2005, pp. 245-253. (Pubitemid 44375736)
9. G. CORNUEJOLS, M. FISHER, AND G. NEMHAUSER, Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms, Management Sci., 23(1977), pp. 789-810.
10. W. H. CUNNINGHAM, Testing membership in matroid polyhedra, J. Combin. Theory Ser. B, 36(1984), pp. 161-188.
11. S. DOBZINSKI AND M. SCHAPIRA, An improved approximation algorithm for combinatorial auctions with submodular bidders, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 1064-1073. (Pubitemid 43275333)
12. J. EDMONDS, Submodular functions, matroids, and certain polyhedra, in Combinatorial Structures and Their Applications, Gordon and Breach, New York, 1970, pp. 69-87.
13. U. FEIGE, A threshold of In n for approximating set cover, J. ACM, 45(1998), pp. 634-652.
14. U. FEIGE, On maximizing welfare when utility functions are subadditive, in Proceedings of the 38th ACM Symposium on Theory of Computing, 2006, pp. 41-50. (Pubitemid 44306536)
15. U. FEIGE, V. MIRROKNI, AND J. VONDRÁK, Maximizing a non-monotone submodular function, in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007, pp. 461-471.
16. U. FEIGE AND J. VONDRÁK, Approximation algorithms for allocation problems: Improving the factor of 1-1/e, in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006, pp. 667-676. (Pubitemid 351175554)
17. M. L. FISHER, G. L. NEMHAUSER, AND L. A. WOLSEY, An analysis of approximations for maximizing submodular set functions. II., Math. Programming Stud., no. 8(1978), pp. 73-87.
18. L. FLEISCHER, S. FUJISHIGE, AND S. IWATA, A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions, J. ACM, 48(2001), pp. 761-777.
19. L. FLEISCHER, M. X. GOEMANS, V. S. MIRROKNI, AND M. SVIRIDENKO, Tight approximation algorithms for maximum general assignment problems, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 611-620. (Pubitemid 43275282)
20. R. GANDHI, S. KHULLER, S. PARTHASARATHY, AND A. SRINIVASAN, Dependent rounding and its applications to approximation algorithms, J. ACM, 53(2006), pp. 324-360. (Pubitemid 44180741)
21. P. GOUNDAN AND A. SCHULZ, Revisiting the Greedy Approach to Submodular Set Function Maximization, manuscript, 2007.
22. R. L. GRAHAM, Bounds for certain multiprocessor anomalies, Bell System Tech. J., 45(1966), pp. 1563-1581.
23. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.
24. E. HAZAN, S. SAFRA, AND O. SCHWARTZ, On the complexity of approximating κ-set packing, in Approximation, Randomization, and Combinatorial Optimization, Lecture Notes in Comput. Sci. 2764, Springer, Berlin, 2003, pp. 83-97.
25. T. A. JENKYNS, The efficacy of the "greedy" algorithm, in Proceedings of the 7th Southeastern Conference on Combinatorics, Graph Theory and Computing, 1976, pp. 341-350.
26. S. KHOT, R. LIPTON, E. MARKAKIS, AND A. MEHTA, Inapproximability results for combinatorial auctions with submodular utility functions, Algorithmica, 52(2008), pp. 3-18.
27. S. KHULLER, A. MOSS, AND J. NAOR, The budgeted maximum coverage problem, Inform. Process. Lett., 70(1999), pp. 39-45.
28. B. KORTE AND D. HAUSMANN, An analysis of the greedy heuristic for independence systems, Ann. Discrete Math., 2(1978), pp. 65-74.
29. A. KULIK, H. SHACHNAI, AND T. TAMIR, Maximizing submodular functions subject to multiple linear constraints, in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009, pp. 545-554.
30. J. LEE, V. MIRROKNI, V. NAGARAJAN, AND M. SVIRIDENKO, Non-monotone submodular maximization under matroid and knapsack constraints, in Proceedings of the 41st ACM Symposium on Theory of Computing, 2009, pp. 323-332.
31. J. LEE, M. SVIRIDENKO, AND J. VONDRÁK, Submodular maximization over multiple matroids via generalized exchange properties, in Approximation, Randomization, and Combinatorial Optimization, Lecture Notes in Comput. Sci. 5687, Springer, Berlin, 2009, pp. 244-257.
32. B. LEHMANN, D. J. LEHMANN, AND N. NISAN, Combinatorial auctions with decreasing marginal utilities, Games Econom. Behav., 55(2006), pp. 270-296. (Pubitemid 43585597)
33. J. MESTRE, Greedy in approximation algorithms, in Proceedings of the 14th European Symposium on Algorithms, Springer, Berlin, 2006, pp. 528-539. (Pubitemid 44699677)
34. V. MIRROKNI, M. SCHAPIRA, AND J. VONDRÁK, Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions, in Proceedings of the ACM Conference on Electronic Commerce, 2008, pp. 70-77.
35. G. L. NEMHAUSER AND L. A. WOLSEY, Best algorithms for approximating the maximum of a submodular set function, Math. Oper. Res., 3(1978), pp. 177-188.
36. G. L. NEMHAUSER, L. A. WOLSEY, AND M. L. FISHER, An analysis of approximations for maximizing submodular set functions. I., Math. Programming, 14(1978), pp. 265-294.
37. A. SCHRIJVER, A combinatorial algorithm minimizing submodular functions in strongly polynomial time, J. Combin. Theory Ser. B, 80(2000), pp. 346-355.
38. A. SCHRIJVER, Combinatorial Optimization-Polyhedra and Efficiency, Springer, Berlin, 2003.
39. A. SRINIVASAN, Distributions on level-sets with applications to approximation algorithms, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 588-597. (Pubitemid 33068420)
40. M. SVIRIDENKO, A note on maximizing a submodular set function subject to knapsack constraint, Oper. Res. Lett., 32(2004), pp. 41-43.
41. J. VONDRAK, Optimal approximation for the submodular welfare problem in the value oracle model, in Proceedings of the 40th ACM Symposium on Theory of Computing, 2008, pp. 67-74.
42. J. VONDRAK, Symmetry and approximability of submodular maximization problems, in Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009, pp. 651-670.
43. L. WOLSEY, An analysis of the greedy algorithm for the submodular set covering problem, Combinatorica, 2(1982), pp. 385-393.
44. L. WOLSEY, Maximizing real-valued submodular functions: Primal and dual heuristics for location problems, Math. Oper. Res., 7(1982), pp. 410-425.