Submodular approximation: Sampling-based algorithms and lower bounds

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

Volumn , Issue , 2008, Pages 697-706

  Svitkina, Zoya ^a   Fleischer, Lisa ^a  

^a Dartmouth Department of Computer Science_Dartmouth College

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMABILITY; CARDINALITY; CLASSICAL COMPUTERS; GRAPH CUTS; IF THERE ARES; LOAD BALANCING; LOWER BOUNDS; MAKESPAN; OBJECTIVE FUNCTIONS; POLYNOMIAL NUMBERS; SPECIAL STRUCTURES; SUBMODULAR; SUBMODULAR FUNCTION MINIMIZATIONS; SUBMODULAR FUNCTIONS; UPPER AND LOWER BOUNDS;

COMPUTERS; CONTROL THEORY; FIBER OPTIC CHEMICAL SENSORS; FUNCTIONS; LEARNING ALGORITHMS; POLYNOMIAL APPROXIMATION; PROBABILITY DENSITY FUNCTION;

APPROXIMATION ALGORITHMS;

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

References (33)

1. 2) time. In Proc. 45th IEEE Symp. on Foundations of Computer Science, pages 238-247, 2004.
2. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In Proc. 36th ACM Symp. on Theory of Computing, 2004.
3. C. Chekuri, G. Calinescu, M. Pal, and J. Vondrak. Maximizing a submodular set function subject to a matroid constraint. In IPCO, pages 182-196, 2007.
4. W. Cunningham. Minimum, cuts, modular functions, and matroid polyhedra. Networks, 15:205-215, 1985.
5. U. Feige, V. Mirrokni, and J. Vondrak. Maximizing non-monotone submodular functions. In FOCS, 2007.
6. S. Fujishige. Polymatroid dependence structure of a set of random, variables. Info. and Control, 39:55-72, 1978.
7. G. Gens and E. Levner. Computational complexity of approximation algorithms for combinatorial problems. In Proc. 8th Intl. Symp. on Math. Foundations of Comput. Sci. Lecture Notes in Comput. Sci. 74, Springer-Verlag, 1979.
8. M. Goemans, N. Harvey, R. Kleinberg, and V. Mirrokni. On learning submodular functions. Manuscript, 2008.
9. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169-197, 1981.
10. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1988.
11. N. Harvey. Matchings, Matroids and Submodular Functions. PhD thesis, MIT, 2008.
12. A. Hayrapetyan, D. Kempe, M. Pal, and Z. Svitkina. Unbalanced graph cuts. In Proc. 13th European Symposium on Algorithms, 2005.
13. A. Hayrapetyan, C. Swamy, and E. Tardos. Network design for information networks. In Proc. 16th ACM Symp. on Discrete Algorithms, pages 933-942, 2005.
14. D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM, 34:144-162, 1987.
15. B. Hoppe and É. Tardos. The quickest transshipment problem. Math. Oper. Res., 25(1):36-62, 2000.
16. S. Iwata. A faster scaling algorithm for minimizing submodular functions. SIAM J. Comput, 32:833-840, 2003.
17. S. Iwata. Submodular function minimization. Math Programming, 112:45-64, 2008.
18. S. Iwata, L. Fleischer, and S. Fujishige. A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM, 48(4):76.1-777, 200.1.
19. F. Leighton and S. Rao. Multicommodity max-flow mincut theorems and their use in designing approximation algorithms. Journal of the ACM, 46, 1999.
20. J. K. Lenstra, D. B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Math. Programming, 46:259-271, 1990.
21. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1990.
22. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14:265-294, 1978.
23. J. B. Orlin. A faster strongly polynomial time algorithm for submodular function minimization. In IPCO, 2007.
24. M. Queyranne. Minimizing symmetric submodular functions. Math. Programming, 82:3-12, 1998.
25. H. Räcke. Optimal hierarchical decompositions for congestion minimization in networks. In Proc. 40th ACM Symp. on Theory of Computing, pages 255-263, 2008.
26. A. Schrijver. A combinatorial algorithm, minimizing submodular functions in strongly polynomial time. J. of Combinatorial Theory, Ser. B, 80(2):346-355, 2000.
27. M. Sviridenko. A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett., 32(1):41-43, 2004.
28. Z. Svitkina and L. Fleischer. Submodular approximation: Sampling-based algorithms and lower bounds. arXiv:0805.1071 [cs.DS], 2008.
29. Z. Svitkina and E. Tardos. Min-max multiway cut. In Proc. 7th APPROX, pages 207-218, 2004.
30. Z. Svitkina and E. Tardos. Facility location with hierarchical facility costs. In Proc. 17th ACM Symp. on Discrete Algorithms, pages 153-161, 2006.
31. C. Swamy, Y. Sharma, and D. Williamson. Approximation algorithms for prize collecting steiner forest problems with submodular penalty functions. In Proc. 18th ACM Symp. on Discrete Algorithms, pages 1275-1284, 2007.
32. L. Wolsey. An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica, 2(4):385393, 1982.
33. L. Zhao, H. Nagamochi, and T. Ibaraki. Greedy splitting algorithms for approximating multiway partition problems. Mathematical Programming, 102(1):167-183, 2005.