Submodular function minimization under covering constraints

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 671-680

  Iwata, Satoru ^a   Nagano, Kiyohito ^b  

^a KYOTO UNIVERSITY   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONSTANT-FACTOR APPROXIMATION ALGORITHMS; CONTINUOUS RELAXATION; DISCRETE CONVEXITY; PRIMAL DUAL ALGORITHMS; ROUNDING ALGORITHM; SUBMODULAR FUNCTION MINIMIZATION; SUBMODULAR FUNCTIONS; VERTEX COVER PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 77952366376     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.31     Document Type: Conference Paper

References (35)

1. R. Bar-Yehuda and S. Even: A linear time approximation algorithm for the weighted vertex cover problem. J. Algorithms, 2 (1981), pp. 198-203.
2. B. Bollobás: Random Graphs. Academic Press, 1985.
3. F. Chudak and K. Nagano: Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization. Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (2007), pp. 79-88.
4. J. Edmonds: Submodular functions, matroids, and certain polyhedra. Combinatorial Structures and Their Applications, R. Guy, H. Hanani, N. Sauer, and J. Schönheim, eds., Gordon and Breach, 1970, pp. 69-87.
5. P. Erdos and A. Rényi: On the existence of a factor of degree one of a connected random graph. Acta Math. Acad. Sci. Hungar., 17 (1966), pp. 359-368.
6. U. Feige, V. Mirrokni, and J. Vondrák: Maximizing nonmonotone submodular functions. Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (2007), pp. 461-471.
7. L. Fleischer and S. Iwata: A push-relabel framework for sub-modular function minimization and applications to parametric optimization. Discrete Appl. Math., 131 (2003), pp. 311-322.
8. S. Fujishige: Submodular Functions and Optimization. Elsevier, Amsterdam, 2005.
9. G. Goel, C. Karande, P. Tripathi, and L. Wang: Approxima-bility of combinatorial problems with multi-agent submodular cost functions. Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (2009), to appear.
10. M. X. Goemans, N. Harvey, R. Kleinberg, and V. Mirrokni: On learning submodular functions. Manuscript, 2008.
11. M. X. Goemans and V. S. Ramakrishnan: Minimizing sub-modular functions over families of sets. Combinatorica, 15 (1995), pp. 499-513.
12. M. Grötschel, L. Lovász, and A. Schrijver: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1 (1981), pp. 169-197.
13. M. Grötschel, L. Lovász, and A. Schrijver: Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, 1988.
14. A. Hayrapetyan, C. Swamy, and É. Tardos: Network design for information networks. Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (2005), pp. 933-942.
15. D. S. Hochbaum: Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput., 11 (1982), pp. 555-556.
16. D. S. Hochbaum, N. Megiddo, J. Naor and A. Tamir: Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Programming, 62 (1993), pp. 69-83.
17. S. Iwata: A faster scaling algorithm for minimizing submodular functions. SIAM J. Comput, 32 (2003), pp. 833-840.
18. S. Iwata, L. Fleischer, and S. Fujishige: A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM, 48 (2001), pp. 761-777.
19. S. Iwata and J. B. Orlin: A simple combinatorial algorithm for submodular function minimization. Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (2009), pp. 1230-1237.
20. S. Khot and O. Regev: Vertex cover might be hard to approximate to within 2 - ε. Journal of Computer and System Sciences, 74 (2008), pp. 335-349.
21. R. Kohli, R. Krishnamurti, and P. Mirchandani: The minimum satisfiability problem. SIAM J. Discrete Math., 7 (1994), pp. 275-283.
22. C. Koufogiannakis and N. Young: Greedy Δ-approximation algorithm for covering with arbitrary constraints and submod-ular cost. In: S. Albers et al. (eds.) ICALP 2009, Part I, LNCS, vol 5555, pp. 634-652.
23. J. Lee, V. Mirrokni, V. Nagarajan, and M. Sviridenko: Maximizing non-monotone submodular functions under matroid and knapsack constraints. Proceedings of the 41th Annual ACM Symposium on Theory of Computing (2009), pp. 323-332.
24. L. Lovász: Submodular functions and convexity. Mathematical Programming - The State of the Art. A. Bachem, M. Grötschel and B. Korte, eds., Springer-Verlag, 1983, pp. 235-257.
25. M. Mitzenmacher and E. Upfal: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
26. K. Nagano: A faster parametric submodular function minimization algorithm and applications. METR 2007-43, University of Tokyo, July 2007.
27. G. L. Nemhauser and L. E. Trotter, Jr.: Properties of vertex packing and independence system polyhedra. Math. Programming, 6 (1974), pp. 48-61.
28. Y. Nesterov: Smooth minimization of non-smooth functions. Math. Programming, 103 (2005), pp. 127-152.
29. Y. Nesterov: Excessive gap technique in nonsmooth convex minimization. SIAM J. Optim., 16 (2005), pp. 235-249.
30. J. B. Orlin: A faster strongly polynomial time algorithm for submodular function minimization. Math. Programming, 118 (2009), pp. 237-251.
31. A. Schrijver: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combinatorial Theory (B), 80 (2000), pp. 346-355.
32. A. Schrijver: Combinatorial Optimization - Polyhedra and Efficiency. Springer-Verlag, 2003.
33. Z. Svitkina and L. Fleischer: Submodular approximation: sampling-based algorithms and lower bounds. Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (2008), pp. 697-706.
34. V. V. Vazirani: Approximation Algorithms. Springer-Verlag, 2001.
35. J. Vondrák: Optimal approximation for the submodular welfare problem in the value oracle model. Proceedings of the 40th Annual ACM Symposium on Theory of Computing (2008), pp. 67-74.