A tight linear time (1/2)-approximation for unconstrained submodular maximization

SIAM Journal on Computing

Volumn 44, Issue 5, 2015, Pages 1384-1402

  Buchbinder, Niv ^a   Feldman, Moran ^b   Naor, Joseph Seffi ^c   Schwartz, Roy ^d  

^a TEL AVIV UNIVERSITY   (Israel)

^b EPFL   (Switzerland)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d Princeton University   (United States)

Author keywords

Approximation algorithms; Linear time; Submodular functions

Indexed keywords

ALGORITHMS; CLUSTERING ALGORITHMS; OPTIMIZATION;

FACILITY LOCATIONS; GREEDY APPROACHES; LINEAR TIME; LINEAR-TIME ALGORITHMS; MAXIMIZATION PROBLEM; SUBMODULAR FUNCTIONS; SUBMODULAR OPTIMIZATIONS; SYMMETRY PROPERTIES;

APPROXIMATION ALGORITHMS;

EID: 84945963122     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/130929205     Document Type: Conference Paper

References (40)

1. A. A. Ageev and M. I. Sviridenko, An 0.828 approximation algorithm for the uncapacitated facility location problem, Discrete Appl. Math., 93 (1999), pp. 149-156.
2. S. Ahmed and A. Atamtürk, Maximizing a class of submodular utility functions, Math. Program., 128 (2011), pp. 149-169.
3. N. Buchbinder, M. Feldman, J. Naor, and R. Schwartz, Submodular maximization with cardinality constraints, in Proceedings of SODA, 2014, pp. 1433-1452.
4. G. Calinescu, C. Chekuri, M. Pal, and J. Vondrák, Maximizing a monotone submodular function subject to a matroid constraint, SIAM J. Comput., 40 (2011), pp. 1740-1766.
5. C. Chekuri, J. Vondrák, and R. Zenklusen, Dependent randomized rounding via exchange properties of combinatorial structures, in Proceedings of FOCS, 2010, pp. 575-584.
6. C. Chekuri, J. Vondrák, and R. Zenklusen, Submodular function maximization via the multilinear relaxation and contention resolution schemes, in Proceedings of STOC, 2011, pp. 783-792.
7. V. P. Cherenin, Solving some combinatoiral problems of optimal planning by the method of successive calculations (in Russian), in Proceedings of the Conference on Experiences and Perspectives on the Applications of Mathematical Methods and Electronic Computers in Planning, Novosibirsk, 1962.
8. G. Cornuejols, M. L. Fisher, and G. L. Nemhauser, Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms, Management Sci., 23 (1977), pp. 789-810.
9. G. Cornuejols, M. L. Fisher, and G. L. Nemhauser, On the uncapacitated location problem, Ann. Discrete Math., 1 (1977), pp. 163-177.
10. S. Dobzinski and J. Vondrák, From query complexity to computational complexity, in Proceedings of STOC, 2012, pp. 1107-1116.
11. S. Dughmi, T. Roughgarden, and M. Sundararajan, Revenue submodularity, Theory Comput., 8 (2012), pp. 95-119.
12. U. Feige, V. S. Mirrokni, and J. Vondrák, Maximizing non-monotone submodular functions, SIAM J. Comput., 40 (2011), pp. 1133-1153.
13. M. Feldman, J. Naor, and R. Schwartz, Nonmonotone submodular maximization via a structural continuous greedy algorithm, in Proceedings of ICALP, 2011, pp. 342-353.
14. M. Feldman, J. Naor, and R. Schwartz, A unified continuous greedy algorithm for submodular maximization, in Proceedings of FOCS, 2011, pp. 570-579.
15. S. O. Gharan and J. Vondrák, Submodular maximization by simulated annealing, in Proceedings of SODA, 2011, pp. 1098-1117.
16. M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, 42 (1995), pp. 1115-1145.
17. B. Goldengorin and D. Ghosh, A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem, J. Global Optim., 32 (2005), pp. 65-82.
18. B. Goldengorin, G. Sierksma, G. A. Tijssen, and M. Tso, The data-correcting algorithm for the minimization of supermodular functions, Management Sci., 45 (1999), pp. 1539-1551.
19. B. Goldengorin, G. A. Tijssen, and M. Tso, The Maximization of Submodular Functions: Old and New Proofs for the Correctness of the Dichotomy Algorithm, Research report 99A17, Research Institute SOM (Systems, Organisations and Management), University of Groningen, 1999.
20. A. Gupta, A. Roth, G. Schoenebeck, and K. Talwar, Constrained non-monotone submodular maximization: Offline and secretary algorithms, in Internet and Network Economics, Lecture Notes in Comput. Sci. 6484, Springer-Verlag, New York, 2010, pp. 246-257.
21. E. Halperin and U. Zwick, Combinatorial approximation algorithms for the maximum directed cut problem, in Proceedings of SODA, 2001, pp. 1-7.
22. J. Hartline, V. Mirrokni, and M. Sundararajan, Optimal marketing strategies over social networks, in Proceedings of WWW, 2008, pp. 189-198.
23. J. Hastad, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859.
24. N. Huang and A. Borodin, Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-Monotone Submodular Maximization, CoRR abs/1312.2173, 2013.
25. S. Iwata and K. Nagano, Submodular function minimization under covering constraints, in Proceedings of FOCS, 2009, pp. 671-680.
26. S. Jegelka and J. Bilmes, Cooperative Cuts: Graph Cuts with Submodular Edge Weights, Technical report 189-03-2010, Max Planck Institute for Biological Cybernetics, Tuebingen, 2010.
27. R. M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, 1972, pp. 85-103.
28. V. R. Khachaturov, Some Problems of the Consecutive Calculation Method and Its Applications to Location Problems (in Russian), Ph.D. thesis, Central Economics and Mathematics Institute, Russian Academy of Sciences, Moscow, 1968.
29. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell, Optimal inapproximability results for max-cut and other 2-variable csps?, SIAM J. Comput., 37 (2007), pp. 319-357.
30. A. Kulik, H. Shachnai, and T. Tamir, Maximizing submodular set functions subject to multiple linear constraints, in Proceedings of SODA, 2009, pp. 545-554.
31. H. Lee, G. L. Nemhauser, and Y. Wang, Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case, European J. Oper. Res., 94 (1996), pp. 154-166.
32. J. Lee, V. S. Mirrokni, V. Nagarajan, and M. Sviridenko, Maximizing non-monotone submodular functions under matroid or knapsack constraints, SIAM J. Discrete Math., 23 (2010), pp. 2053-2078.
33. J. Lee, M. Sviridenko, and J. Vondrák, Submodular maximization over multiple matroids via generalized exchange properties, in Proceedings of APPROX, 2009, pp. 244-257.
34. L. Lovász, M. Grötschel, and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatoria, 1 (1981), pp. 169-197.
35. M. Minoux, Accelerated greedy algorithms for maximizing submodular set functions, in Optimization Techniques, J. Stoer, ed., Lecture Notes in Control and Inform. Sci. 7, Springer, Berlin, 1978, pp. 234-243.
36. A. S. Schulz and N. A. Uhan, Approximating the least core and least core value of cooperative games with supermodular costs, Discrete Optim., 10 (2013), pp. 163-180.
37. Z. Svitkina and L. Fleischer, Submodular approximation: Sampling-based algorithms and lower bounds, in Proceedings of FOCS, 2008, pp. 697-706.
38. L. Trevisan, G. B. Sorkin, M. Sudan, and D. P. Williamson, Gadgets, approximation, and linear programming, SIAM J. Comput., 29 (2000), pp. 2074-2097.
39. J. Vondrák, Personal communication, 2012.
40. J. Vondrák, Symmetry and approximability of submodular maximization problems, in Proceedings of FOCS, 2009, pp. 651-670.