Abstract
We introduce and study \(\ell _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 \(\ell _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=\infty \)), both of which are well-studied classic problems in the graph partitioning literature. We show that \(\ell _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 ^{1.5}{n} \log ^{0.5}{k})\)-approximation for all \(p\ge 1\). We also show an integrality gap of \(\Omega (k^{1-1/p})\) for a natural convex program and an \(O(k^{1-1/p-\epsilon })\)-inapproximability for any constant \(\epsilon >0\) assuming the small set expansion hypothesis.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Notes
Throughout this work, all NP-hardness results are strong NP-hardness results and all logarithms are to the base 2.
References
Ahmadi, S., Khuller, S., Saha, B.: Min–Max Correlation Clustering via Multicut, pp. 13–26. Integer Programming and Combinatorial Optimization, IPCO, Atlanta (2019)
Angelidakis, H., Makarychev, Y., Manurangsi, P.: An Improved Integrality Gap for the Călinescu–Karloff–Rabani Relaxation for Multiway Cut, pp. 39–50. Integer Programming and Combinatorial Optimization, IPCO, Atlanta (2017)
Bansal, N., Feige, U., Krauthgamer, R., Makarychev, K., Nagarajan, V., Naor, J., Schwartz, R.: Min–max graph partitioning and small set expansion. SIAM J. Comput. 43(2), 872–904 (2014)
Bérczi, K., Chandrasekaran, K., Király, T., Madan, V.: Improving the integrality gap for multiway cut. Math. Program. 183, 171–193 (2020)
Buchbinder, N., Naor, J., Schwartz, R.: Simplex partitioning via exponential clocks and the multiway cut problem. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC, pp. 535–544 (2013)
Buchbinder, N., Schwartz, R., Weizman, B.: Simplex transformations and the multiway cut problem. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 2400–2410 (2017)
Călinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. J. Comput. Syst. Sci. 60(3), 564–574 (2000)
Chandrasekaran, K., Chekuri, C.: Min–max partitioning of hypergraphs and symmetric submodular functions. In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1026–1038 (2021)
Charikar, M., Gupta, N., Schwartz, R.: Local Guarantees in Graph Cuts and Clustering, pp. 136–147. Integer Programming and Combinatorial Optimization, IPCO, Atlanta (2017)
Chekuri, C., Ene, A.: Submodular cost allocation problem and applications. In: International Colloquium on Automata, Languages and Programming, ICALP, pp. 354–366 (2011)
Cheung, K., Cunningham, W., Tang, L.: Optimal 3-terminal cuts and linear programming. Math. Program. 106(1), 1–23 (2006)
Chvátal, V.: Recognizing decomposable graphs. J. Graph Theory 8, 51–53 (1984)
Dahlhaus, E., Johnson, D., Papadimitriou, C., Seymour, P., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23(4), 864–894 (1994)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences, W.H. Freeman, San Francisco (1979)
Kalhan, S., Makarychev, K., Zhou, T.: Correlation clustering with local objectives. Adv. Neural Inf. Process. Syst. 32, 9346–9355 (2019)
Karger, D., Klein, P., Stein, C., Thorup, M., Young, N.: Rounding algorithms for a geometric embedding of minimum multiway cut. Math. Oper. Res. 29(3), 436–461 (2004)
Manokaran, R., Naor, J., Raghavendra, P., Schwartz, R.: 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, pp. 11–20 (2008)
Marx, D.: Parameterized graph separation problems. Theor. Comput. Sci. 351(3), 394–406 (2006)
Puleo, G., Milenkovic, O.: Correlation clustering and biclustering with locally bounded errors. IEEE Trans. Inf. Theory 64, 4105–4119 (2018)
Raghavendra, P., Steurer, D., Tulsiani, M.: Reductions between expansion problems. In: IEEE Conference on Computational Complexity, CCC, pp. 64–73 (2012)
Sharma, A., Vondrák, J.: Multiway cut, pairwise realizable distributions, and descending thresholds. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, STOC, pp. 724–733 (2014)
Svitkina, Z., Tardos, É.: Min–max multiway cut. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX, pp. 207–218 (2004)
Acknowledgements
Karthik would like to thank Ali Bibak for initial discussions on parts of this work.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supported in part by NSF Grants CCF-1814613 and CCF-1907937. A preliminary version of this work appeared at European Symposium on Algorithms (ESA), 2021.
Rights and permissions
About this article
Cite this article
Chandrasekaran, K., Wang, W. \(\ell _p\)-Norm Multiway Cut. Algorithmica 84, 2667–2701 (2022). https://doi.org/10.1007/s00453-022-00983-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-022-00983-3