Approximation algorithms for submodular multiway partition

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

Volumn , Issue , 2011, Pages 807-816

  Chekuri, Chandra ^a   Ene, Alina ^a  

^a Digital Computer Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIVIDE AND CONQUER; HYPER GRAPH; K ELEMENTS; MODULAR FUNCTIONS; MULTIWAY CUT PROBLEMS; MULTIWAY PARTITION PROBLEM; SET FUNCTION; SUBMODULAR; SYMMETRIC FUNCTIONS;

APPROXIMATION ALGORITHMS; CONVEX PROGRAMMING;

COMPUTER SCIENCE;

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

References (29)

1. C. Alpert and A. Kahng, "Recent developments in netlist partitioning: A survey," Integration: the VLSI Journal, vol. 19, no. 1-2, pp. 1-81, 1995.
2. G. Calinescu, C. Chekuri, M. Pál, and J. Vondrák, "Maximizing a submodular set function subject to a matroid constraint (extended abstract)," in Integer Programming and Combinatorial Optimization (IPCO), 2007, pp. 182-196.
3. G. Calinescu, H. J. Karloff, and Y. Rabani, "An improved approximation algorithm for multiway cut," Journal of Computer and System Sciences, vol. 60, no. 3, pp. 564-574, 2000, preliminary version in STOC 1998.
4. C. Chekuri and A. Ene, "Approximation algorithms for submodular multiway partition," CoRR, vol. abs/1105.2048, 2011.
5. -, "Submodular cost allocation problem and applications,"in International Colloquium on Automata, Languages and Programming (ICALP (1)), 2011, pp. 354-366, A longer version is available on the arXiv, abs/1105.2040.
6. -, "Submodular cost allocation problem and applications,"CoRR, vol. abs/1105.2040, 2011.
7. C. Chekuri, S. Guha, and J. Naor, "The steiner k-cut problem,"SIAM J. Discrete Math., vol. 20, no. 1, pp. 261-271, 2006.
8. C. Chekuri, J. Vondrák, and R. Zenklusen, "Submodular function maximization via the multilinear extension and contention resolution schemes," in Proceedings of the ACM Symposium on Theory of Computing (STOC), 2011, pp. 783-792.
9. E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis, "The complexity of multiterminal cuts," SIAM Journal on Computing, vol. 23, no. 4, pp. 864-894, 1994, preliminary version in STOC 1992.
10. A. Ene and J. Vondrák, "Improved rounding for submodular multiway partition," Manuscript, May 2011.
11. A. Freund and H. J. Karloff, "A lower bound of 8/(7+1/(k-1)) on the integrality ratio of the calinescu-karloff-rabani relaxation for multiway cut," Information Processing Letters, vol. 75, no. 1-2, pp. 43-50, 2000.
12. T. Fukunaga, "Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings," Integer Programming and Combinatorial Optimization (IPCO), pp. 15-28, 2010.
13. N. Garg, V. V. Vazirani, and M. Yannakakis, "Multiway cuts in directed and node weighted graphs," in ICALP, ser. Lecture Notes in Computer Science, S. Abiteboul and E. Shamir, Eds., vol. 820. Springer, 1994, pp. 487-498.
14. -, "Multiway cuts in node weighted graphs," Journal of Algorithms, vol. 50, no. 1, pp. 49-61, 2004.
15. G. Goel, C. Karande, P. Tripathi, and L. Wang, "Approximability of combinatorial problems with multi-agent submodular cost functions," in IEEE Symposium on Foundations of Computer Science (FOCS), 2009, pp. 755-764.
16. O. Goldschmidt and D. Hochbaum, "A polynomial algorithm for the k-cut problem for fixed k," Mathematics of Operations Research, pp. 24-37, 1994.
17. S. Iwata and K. Nagano, "Submodular function minimization under covering constraints," in IEEE Symposium on Foundations of Computer Science (FOCS), 2009, pp. 671-680.
18. D. R. Karger, P. N. Klein, C. Stein, M. Thorup, and N. E. Young, "Rounding algorithms for a geometric embedding of minimum multiway cut," Mathematics of Operations Research, vol. 29, no. 3, pp. 436-461, 2004, preliminary version in STOC 1999.
19. A. Kulik, H. Shachnai, and T. Tamir, "Maximizing submodular set functions subject to multiple linear constraints," in SODA, C. Mathieu, Ed. SIAM, 2009, pp. 545-554.
20. J. Lee, V. S. Mirrokni, V. Nagarajan, and M. Sviridenko, "Maximizing nonmonotone submodular functions under matroid or knapsack constraints," SIAM J. Discrete Math., vol. 23, no. 4, pp. 2053-2078, 2010.
21. L. Lovász, "Submodular functions and convexity," Mathematical programming: the state of the art, pp. 235-257, 1983.
22. K. Okumoto, T. Fukunaga, and H. Nagamochi, "Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems," Algorithmica, pp. 1-20, 2010, preliminary version in ISAAC 2009. [Online]. Available: http://dx.doi.org/10.1007/s00453-010-9483-0
23. M. Queyranne, "On optimum size-constrained set partitions, "1999, presented at 3rd Combinatorial Optimization Workshop, AUSSOIS '99.
24. Z. Svitkina and É. Tardos, "Min-max multiway cut," Approximation, Randomization, and Combinatorial Optimization (APPROX-RANDOM), pp. 207-218, 2004.
25. J. Vondrák, "Optimal approximation for the submodular welfare problem in the value oracle model," in ACM Symposium on Theory of Computing (STOC), 2008, pp. 67-74.
26. -, "Symmetry and Approximability of Submodular Maximization Problems," in IEEE Symposium on Foundations of Computer Science (FOCS), 2010, pp. 651-670.
27. J. Vondrák, Personal Communication, May 2011.
28. M. Xiao, "Finding minimum 3-way cuts in hypergraphs, "Information Processing Letters, vol. 110, no. 14-15, pp. 554-558, 2010, preliminary version in TAMC 2008.
29. L. Zhao, H. Nagamochi, and T. Ibaraki, "Greedy splitting algorithms for approximating multiway partition problems,"Mathematical Programming, vol. 102, no. 1, pp. 167-183, 2005. (Pubitemid 40141835)