Nonmonotone submodular maximization via a structural continuous greedy algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6755 LNCS, Issue PART 1, 2011, Pages 342-353

  Feldman, Moran ^a   Naor, Joseph ^a   Schwartz, Roy ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BEST APPROXIMATIONS; GREEDY ALGORITHMS; LOWER BOUNDS; MAXIMIZATION PROBLEM; NONMONOTONE; OPTIMAL SOLUTIONS; SUBMODULAR; SUBMODULAR FUNCTIONS; SUBOPTIMAL SOLUTION;

ALGORITHMS;

EID: 79959946623     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22006-7_29     Document Type: Conference Paper

References (18)

1. Calinescu, G., Chekuri, C., Pál, M., Vondrák, J.: Maximizing a monotone submodular function subject to a matroid constraint. To appear in SIAM J. Comput.
2. Chekuri, C., Vondrák, J., Zenklusen, R.: Dependent randomized rounding via exchange properties of combinatorial structures. In: 51st Annual Symposium on Foundations of Computer Science, pp. 575-584. IEEE Computer Society, Washington DC (2010)
3. Chekuri, C., Vondrák, J., Zenklusen, R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. To appear in the 42nd ACM Symposium on Theory of Computer Science (2011)
4. Feige, U., Mirrokni, V.S., Vondrák, J.: Maximizing non-monotone submodular functions. In: 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 461-471. IEEE Computer Society, Washington DC (2007)
5. Gharan, S.O., Vondrák, J.: Submodular maximization by simulated annealing. In: 22nd ACM-SIAM Symposium on Discrete Algorithms, pp. 1096-1116 (2011)
6. Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115-1145 (1995)
7. Gupta, A., Roth, A., Schoenebeck, G., Talwar, K.: Constrained non-monotone submodular maximization: Offline and secretary algorithms. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 246-257. Springer, Heidelberg (2010)
8. Iwata, S., Nagano, K.: Submodular function minimization under covering constraints. In: 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 671-680. IEEE Computer Society, Washington DC (2009)
9. Jegelka, S., Bilmes, J.: Cooperative cuts: Graph cuts with submodular edge weights. Technical report, Max Planck Institute for Biological Cybernetics (2010)
10. Kulik, A., Shachnai, H., Tamir, T.: Maximizing submodular set functions subject to multiple linear constraints. In: 20th ACM-SIAM Symposium on Discrete Algorithms, pp. 545-554. Society for Industrial and Applied Mathematics, Philadelphia (2009)
11. Lee, J., Mirrokni, V.S., Nagarajan, V., Sviridenko, M.: Maximizing non-monotone submodular functions under matroid or knapsack constraints. SIAM J. Discrete Mathematics 23(4), 2053-2078 (2010)
12. Lee, J., Sviridenko, M., Vondrák, J.: Submodular maximization over multiple matroids via generalized exchange properties. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol. 5687, pp. 244-257. Springer, Heidelberg (2009)
13. Lovász, L.: Submodular functions and convexity. In: Bachem, A., Grötschel, M., Korte, B. (eds.) Mathematical Programming: the State of the Art, pp. 235-257. Springer, Berlin (1983)
14. Lovász, L., Grötschel, M., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatoria 1(2), 169-197 (1981)
15. Svitkina, Z., Fleischer, L.: Submodular approximation: Sampling-based algorithms and lower bounds. In: 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 697-706. IEEE Computer Society, Washington DC (2008)
16. Vondrák, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: 40th ACM Symposium on Theory of Computer Science, pp. 67-74. ACM, New York (2008)
17. Vondrák, J.: Symmetry and approximability of submodular maximization problems. In: 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 651-670. IEEE Computer Society, Washington DC (2009)
18. Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4), 385-393 (1982)