Local distribution and the symmetry gap: Approximability of multiway partitioning problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2013, Pages 306-325

  Ene, Alina ^a   Vondrák, Jan ^b   Wu, Yi ^c  

^a Digital Computer Laboratory   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; HARDNESS; OPTIMIZATION;

LOCAL DISTRIBUTIONS; MAXIMIZATION PROBLEM; MINIMIZATION PROBLEMS; MULTIWAY PARTITION PROBLEM; MULTIWAY PARTITIONING; OPTIMAL APPROXIMATION; SUBMODULAR FUNCTIONS; UNIQUE GAMES CONJECTURE;

GEOGRAPHICAL DISTRIBUTION;

EID: 84876039914     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973105.23     Document Type: Conference Paper

References (26)

1. Gruia Calinescu, Howard J. Karloff, and Yuval Rabani. An improved approximation algorithm for multi-way cut. Journal of Computer and System Sciences, 60(3):564-574, 2000.
2. Preliminary version in STOC 1998.
3. Chandra Chekuri and Alina Ene. Approximation algorithms for submodular multiway partition. In IEEE Symposium on Foundations of Computer Science (FOCS), 2011.
4. Chandra Chekuri and Alina Ene. Submodular cost allocation problem and applications. In Automata, Languages and Programming (ICALP), pages 354-366, 2011. A longer version is available on the arXiv, abs/1105.2040.
5. Chandra Chekuri, Jan Vondrák, and Rico Zenklusen. Submodular function maximization via the multilinear extension and contention resolution schemes. In ACM Symposium on Theory of Computing (STOC), pages 783-792, 2011.
6. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, and Mihalis Yannakakis. The complexity of multiterminal cuts. SIAM Journal on Computing, 23(4):864-894, 1994.
7. Preliminary version in STOC 1992.
8. Shahar Dobzinski and Jan Vondrák. From query complexity to computational complexity. In ACM Symposium on Theory of Computing (STOC), 2012.
9. Naveen Garg, Vijay V. Vazirani, and Mihalis Yannakakis. Multiway cuts in node weighted graphs. Journal of Algorithms, 50(1):49-61, 2004.
10. Preliminary version in ICALP 1994.
11. Satoru Iwata and Kiyohito Nagano. Submodular function minimization under covering constraints. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 671-680, 2009.
12. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, and Neal E. Young. Rounding algorithms for a geometric embedding of minimum multiway cut. Mathematics of Operations Research, 29(3):436-461, 2004.
13. Preliminary version in STOC 1999.
14. Ariel Kulik, Hadas Shachnai, and Tami Tamir. Maximizing submodular set functions subject to multiple linear constraints. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 545-554, 2009.
15. Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, and Nisheeth K. Vishnoi. On LP-based approximability for strict CSPs. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1560-1573, 2011.
16. Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, and Maxim Sviridenko. Maximizing nonmonotone submodular functions under matroid or knapsack constraints. SIAM Journal on Discrete Mathematics, 23(4):2053-2078, 2010.
17. László Lovász. Submodular functions and convexity. In Mathematical programming: the state of the art, pages 235-257. Springer, 1983.
18. Rajsekar Manokaran, Joseph S. Naor, Prasad Raghavendra, and Roy Schwartz. SDP gaps and UGC hardness for multiway cut, 0-extension, and metric labeling. In ACM Symposium on Theory of Computing (STOC), pages 11-20, 2008.
19. Elchanan Mossel, Ryan O'Donnell, and Krzysztof Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 21-30, 2005.
20. Kazumasa Okumoto, Takuro Fukunaga, and Hiroshi Nagamochi. Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems. Algorithmica, pages 1-20, 2010.
21. Preliminary version in ISAAC 2009.
22. Prasad Raghavendra. Approximating NP-hard problems: efficient algorithms and their limits. PhD thesis, University of Washington, 2009.
23. Jan Vondrák. Optimal approximation for the submodular welfare problem in the value oracle model. In ACM Symposium on Theory of Computing (STOC), pages 67-74, 2008.
24. Jan Vondrák. Symmetry and approximability of submodular maximization problems. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 651-670, 2009.
25. Jan Vondrák. Symmetry and approximability of submodular maximization problems. Available on the arXiv, abs/1110.4860, 2011.
26. Liang Zhao, Hiroshi Nagamochi, and Toshihide Ibaraki. Greedy splitting algorithms for approximating multiway partition problems. Mathematical Programming, 102(1):167-183, 2005.