Document Open Access Logo

𝓁_p-Norm Multiway Cut

Authors Karthekeyan Chandrasekaran , Weihang Wang

PDF
Thumbnail PDF

File

LIPIcs.ESA.2021.29.pdf
  • Filesize: 0.83 MB
  • 15 pages

Document Identifiers

Author Details

Karthekeyan Chandrasekaran
  • University of Illinois at Urbana-Champaign, IL, USA
Weihang Wang
  • University of Illinois at Urbana-Champaign, IL, USA

Funding

  • Chandrasekaran, Karthekeyan: Supported in part by NSF grants CCF 1814613 and 1907937.
  • Wang, Weihang: Supported in part by NSF grants CCF 1814613 and 1907937.

Cite As Get BibTex

Karthekeyan Chandrasekaran and Weihang Wang. 𝓁_p-Norm Multiway Cut. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 29:1-29:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021) https://doi.org/10.4230/LIPIcs.ESA.2021.29

Abstract

We introduce and study 𝓁_p-norm-multiway-cut: the input here is an undirected graph with non-negative edge weights along with k terminals and the goal is to find a partition of the vertex set into k parts each containing exactly one terminal so as to minimize the 𝓁_p-norm of the cut values of the parts. This is a unified generalization of min-sum multiway cut (when p = 1) and min-max multiway cut (when p = ∞), both of which are well-studied classic problems in the graph partitioning literature. We show that 𝓁_p-norm-multiway-cut is NP-hard for constant number of terminals and is NP-hard in planar graphs. On the algorithmic side, we design an O(log² n)-approximation for all p ≥ 1. We also show an integrality gap of Ω(k^{1-1/p}) for a natural convex program and an O(k^{1-1/p-ε})-inapproximability for any constant ε > 0 assuming the small set expansion hypothesis.

Subject Classification

ACM Subject Classification
  • Theory of computation → Approximation algorithms analysis
Keywords
  • multiway cut
  • approximation algorithms

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. S. Ahmadi, S. Khuller, and B. Saha. Min-max correlation clustering via multicut. In Integer Programming and Combinatorial Optimization, IPCO, pages 13-26, 2019. Google Scholar
  2. H. Angelidakis, Y. Makarychev, and P. Manurangsi. An improved integrality gap for the Călinescu-Karloff-Rabani relaxation for multiway cut. In Integer Programming and Combinatorial Optimization, IPCO, pages 39-50, 2017. Google Scholar
  3. N. Bansal, U. Feige, R. Krauthgamer, K. Makarychev, V. Nagarajan, J. Naor, and R. Schwartz. Min-max graph partitioning and small set expansion. SIAM Journal on Computing, 43(2):872-904, 2014. Google Scholar
  4. K. Bérczi, K. Chandrasekaran, T. Király, and V. Madan. Improving the integrality gap for multiway cut. Mathematical Programming, 183:171-193, 2020. Google Scholar
  5. N. Buchbinder, J. Naor, and R. Schwartz. Simplex partitioning via exponential clocks and the multiway cut problem. In Proceedings of the forty-fifth annual ACM Symposium on Theory of Computing, STOC, pages 535-544, 2013. Google Scholar
  6. N. Buchbinder, R. Schwartz, and B. Weizman. Simplex transformations and the multiway cut problem. In Proceedings of the twenty-eighth annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 2400-2410, 2017. Google Scholar
  7. G. Călinescu, H. Karloff, and Y. Rabani. An improved approximation algorithm for multiway cut. Journal of Computer and System Sciences, 60(3):564-574, 2000. Google Scholar
  8. K. Chandrasekaran and C. Chekuri. Min-max partitioning of hypergraphs and symmetric submodular functions. In Proceedings of the thirty-second annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 1026-1038, 2021. Google Scholar
  9. K. Chandrasekaran and W. Wang. 𝓁_p-norm Multiway Cut. Preprint in arXiv: 2106.14840, 2021. Google Scholar
  10. M. Charikar, N. Gupta, and R. Schwartz. Local guarantees in graph cuts and clustering. In Integer Programming and Combinatorial Optimization, IPCO, pages 136-147, 2017. Google Scholar
  11. C. Chekuri and A. Ene. Submodular cost allocation problem and applications. In International Colloquium on Automata, Languages and Programming, ICALP, pages 354-366, 2011. Google Scholar
  12. K. Cheung, W. Cunningham, and L. Tang. Optimal 3-terminal cuts and linear programming. Mathematical Programming, 106(1):1-23, March 2006. Google Scholar
  13. V. Chvátal. Recognizing decomposable graphs. Journal of Graph Theory, 8:51-53, 1984. Google Scholar
  14. E. Dahlhaus, D. Johnson, C. Papadimitriou, P. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM Journal on Computing, 23(4):864-894, 1994. Google Scholar
  15. S. Kalhan, K. Makarychev, and T. Zhou. Correlation clustering with local objectives. In Advances in Neural Information Processing Systems 32, pages 9346-9355, 2019. Google Scholar
  16. D. Karger, P. Klein, C. Stein, M. Thorup, and N. Young. Rounding algorithms for a geometric embedding of minimum multiway cut. Mathematics of Operations Research, 29(3):436-461, 2004. Google Scholar
  17. R. Manokaran, J. Naor, P. Raghavendra, and R. Schwartz. SDP gaps and UGC hardness for multiway cut, 0-extension, and metric labeling. In Proceedings of the fortieth annual ACM Symposium on Theory of Computing, STOC, pages 11-20, 2008. Google Scholar
  18. D. Marx. Parameterized graph separation problems. Theoretical Computer Science, 351(3):394-406, 2006. Google Scholar
  19. G. Puleo and O. Milenkovic. Correlation clustering and biclustering with locally bounded errors. IEEE Transactions on Information Theory, 64:4105-4119, 2018. Google Scholar
  20. P. Raghavendra, D. Steurer, and M. Tulsiani. Reductions between expansion problems. In IEEE Conference on Computational Complexity, CCC, pages 64-73, 2012. Google Scholar
  21. A. Sharma and J. Vondrák. Multiway cut, pairwise realizable distributions, and descending thresholds. In Proceedings of the forty-sixth annual ACM Symposium on Theory of Computing, STOC, pages 724-733, 2014. Google Scholar
  22. Z. Svitkina and É. Tardos. Min-max multiway cut. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX, pages 207-218, 2004. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact