## AI helps you reading Science

## AI Insight

AI extracts a summary of this paper

Weibo:

# Faster Minimum k-cut of a Simple Graph

2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), pp.1056.0-1077, (2019)

EI

Abstract

We consider the (exact, minimum) k-CUT problem: given a graph and an integer k, delete a minimum-weight set of edges so that the remaining graph has at least k connected components. This problem is a natural generalization of the global minimum cut problem, where the goal is to break the graph into k = 2 pieces. Our main result is a (comb...More

Code:

Data:

Introduction

- The authors consider the k-Cut problem: given a graph and an integer k, delete a minimumweight set of edges so that the remaining graph has at least k connected components.
- The authors apply a reduction in [9] which, at a multiplicative cost of O(nk) in the running time, produces a tree T such that exactly k − 1 edges of T have endpoints in different components of the minimum k-cut.
- Since s–t minimum cut is polynomial time solvable, the algorithm can detect which edges to contract.

Highlights

- We consider the k-Cut problem: given a graph and an integer k, delete a minimumweight set of edges so that the remaining graph has at least k connected components. This problem is a natural generalization of the global minimum cut problem, where the goal is to break the graph into k = 2 pieces
- This problem has been actively studied in theory of both exact and approximation algorithms, where each result brought new insights and tools on graph cut algorithms
- The fastest algorithm for general edge weights is due to Chekuri et al [4]

Results

- For each connected component C in H, there exists a spanning tree TC of C satisfying the following property: Let U be the set of endpoints of edges in TC (more formally, U := (u,v)∈E(TC){u, v}).
- Observe that if Conditions 4.5 and 4.6 hold, for each connected component Ci∗, there exists a set Ui∗ ∈ U of size |V (Ci∗)| such that each vertex vj∗ in Ci∗ belongs on a branch T (u) (u ∈ Ui∗).
- After running Algorithm 4.7, Conditions 4.5 and 4.6 hold, and for each connected component Ci∗, there exists a set Ui∗ ∈ U of size |V (Ci∗)| such that each vertex vj∗ in Ci∗ belongs on a branch T (u) (u ∈ U ).
- The ancestor cut has one edge sharing a maximal branch with each vertex in MinElts(Ui).
- The authors want a set of disjoint branches, one containing each minimal vertex, such that a variant of Lemma 4.4 still holds, so that the authors can set up a similar minimum s–t cut problem.
- For each connected component C in H, there exists a spanning tree TC of C satisfying the following property: Let U be the set of endpoints of edges in TC.
- Construct the graph Gb as follows: the add that edge with endpoints b(u), vertex b(v) in set is i Bi∗, and for each edge in Gb. Note that if the authors contract each
- Fix any component Ci∗, and let U be the set of endpoints in T ′ of edges in Ti∗.

Conclusion

- For each connected component C of H′, let C+ be the set of vertices in H contracted to a vertex in C.
- After running Algorithms 4.25 and 4.30, Conditions 4.23, 4.24, 4.26, 4.27, and 4.28 hold, and for each Ci+, there exists a set Ui+ ∈ U whose subtrees contain precisely all vertices vj∗ in Ci+.
- The minimum ancestor p-cut is the following problem: For each i ∈ [l], remove at least one edge in T (note: not T ′(ui)) such that after removal, no sj ∈ V (T) is in the same component as ui, and such that exactly p − 1 edges are removed in total.

Related work

- The k-Cut problem has been studied extensively in the approximate and fixed-parameter settings as well.

Approximation algorithms. The first approximation algorithm k-Cut was a 2(1−1/k)-approximation of Saran and Vazirani [23]. Later, Naor and Rabani [21], and also Ravi and Sinha [22] gave 2-approximation algorithms using tree packing and network strength respectively. Xiao et al [27] extended Kapoor [13] and Zhao et al [28] and generalized Saran and Vazirani to give an (2 − h/k)-approximation in time nO(h). On the hardness front, Manurangsi [18] showed that for any ǫ > 0, it is NP-hard to achieve a (2 − ǫ)-approximation algorithm in time poly(n, k) assuming the Small Set Expansion Hypothesis.

Reference

- Amir Abboud, Arturs Backurs, and Virginia Vassilevska Williams. If the current clique algorithms are optimal, so is Valiant’s parser. In Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on, pages 98–117. IEEE, 2015.
- Noga Alon, Raphael Yuster, and Uri Zwick. Color-coding. J. ACM, 42(4):844–856, 1995.
- Sanjeev Arora, Satish Rao, and Umesh Vazirani. Expander flows, geometric embeddings and graph partitioning. Journal of the ACM (JACM), 56(2):5, 2009.
- Chandra Chekuri, Kent Quanrud, and Chao Xu. Lp relaxation and tree packing for minimum k-cuts. arXiv preprint arXiv:1808.05765, 2018.
- Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, and Michal Pilipczuk. Designing FPT algorithms for cut problems using randomized contractions. SIAM J. Comput., 45(4):1171–1229, 2016. URL: http://dx.doi.org/10.1137/15M1032077, doi:10.1137/15M1032077.
- Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized algorithms. Springer, Cham, 2015. URL: http://dx.doi.org/10.1007/978-3-319-21275-3, doi:10.1007/978-3-319-21275-3.
- Rodney G. Downey, Vladimir Estivill-Castro, Michael Fellows, Elena Prieto, and Frances A. Rosamund. Cutting up is hard to do: The parameterised complexity of k-cut and related problems. Electronic Notes in Theoretical Computer Science, 78:209–222, 2003.
- Olivier Goldschmidt and Dorit S. Hochbaum. A polynomial algorithm for the k-cut problem for fixed k. Math. Oper. Res., 19(1):24–37, 1994. URL: http://dx.doi.org/10.1287/moor.19.1.24, doi:10.1287/moor.19.1.24.
- Anupam Gupta, Euiwoong Lee, and Jason Li. Faster exact and approximate algorithms for k-cut. In Foundations of Computer Science (FOCS), 2018 IEEE 59th Annual Symposium on, 2018.
- Anupam Gupta, Euiwoong Lee, and Jason Li. The number of minimum k-cuts: Improving the karger-stein bound. In STOC 2019, to appear, 2019.
- Monika Henzinger, Satish Rao, and Di Wang. Local flow partitioning for faster edge connectivity. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1919–1938. Society for Industrial and Applied Mathematics, 2017.
- Yoko Kamidoi, Noriyoshi Yoshida, and Hiroshi Nagamochi. A deterministic algorithm for finding all minimum k-way cuts. SIAM J. Comput., 36(5):1329–1341, 2006/07. URL: http://dx.doi.org/10.1137/050631616, doi:10.1137/050631616.
- Sanjiv Kapoor. On minimum 3-cuts and approximating k-cuts using cut trees. In Integer programming and combinatorial optimization (Vancouver, BC, 1996), volume 1084 of Lecture Notes in Comput. Sci., pages 132–146. Springer, Berlin, 1996. URL: http://dx.doi.org/10.1007/3-540-61310-2_11, doi:10.1007/3-540-61310-2_11.
- David R. Karger and Clifford Stein. A new approach to the minimum cut problem. Journal of the ACM (JACM), 43(4):601–640, 1996.
- Ken-ichi Kawarabayashi and Mikkel Thorup. The minimum k-way cut of bounded size is fixedparameter tractable. In Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on, pages 160–169. IEEE, 2011.
- Ken-ichi Kawarabayashi and Mikkel Thorup. Deterministic edge connectivity in near-linear time. Journal of the ACM (JACM), 66(1):4, 2018.
- Francois Le Gall. Powers of tensors and fast matrix multiplication. In Proceedings of the 39th international symposium on symbolic and algebraic computation, pages 296–303. ACM, 2014.
- Pasin Manurangsi. Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), volume 80 of Leibniz International Proceedings in Informatics (LIPIcs), pages 79:1–79:14, 2017. URL: http://drops.dagstuhl.de/opus/volltexte/2017/7500, doi:10.4230/LIPIcs.ICALP.2017.79.
- Daniel Marx. Parameterized complexity and approximation algorithms. The Computer Journal, 51(1):60–78, 2007.
- Hiroshi Nagamochi and Toshihide Ibaraki. Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Discrete Math., 5(1):54–66, 1992. URL: http://dx.doi.org/10.1137/0405004, doi:10.1137/0405004.
- Joseph Naor and Yuval Rabani. Tree packing and approximating k-cuts. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, DC, 2001), pages 26–27. SIAM, Philadelphia, PA, 2001.
- R. Ravi and Amitabh Sinha. European J. Oper. Res., 186(1):77–90, 2008.
- URL: http://dx.doi.org/10.1016/j.ejor.2007.01.040, doi:10.1016/j.ejor.2007.01.040.
- [23] Huzur Saran and Vijay V. Vazirani. Finding k-cuts within twice the optimal. SIAM Journal on Computing, 24(1):101–108, 1995.
- [24] Mikkel Thorup. Minimum k-way cuts via deterministic greedy tree packing. In Proceedings of the fortieth annual ACM symposium on Theory of computing, pages 159–166. ACM, 2008.
- [25] Virginia Vassilevska Williams. Multiplying matrices faster than Coppersmith–Winograd. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing, pages 887–898. ACM, 2012.
- [26] Virginia Vassilevska Williams and Ryan Williams. Subcubic equivalences between path, matrix and triangle problems. In Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on, pages 645–654. IEEE, 2010.
- [27] Mingyu Xiao, Leizhen Cai, and Andrew Chi-Chih Yao. Tight approximation ratio of a general greedy splitting algorithm for the minimum k-way cut problem. Algorithmica, 59(4):510–520, 2011.
- [28] Liang Zhao, Hiroshi Nagamochi, and Toshihide Ibaraki. Approximating the minimum k-way cut in a graph via minimum 3-way cuts. J. Comb. Optim., 5(4):397–410, 2001. URL: http://dx.doi.org/10.1023/A:1011620607786, doi:10.1023/A:1011620607786.

Tags

Comments

数据免责声明

页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果，我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问，可以通过电子邮件方式联系我们：report@aminer.cn