A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Fast and Deterministic Approximations for k-Cut
2019
International Workshop on Approximation Algorithms for Combinatorial Optimization
In an undirected graph, a k-cut is a set of edges whose removal breaks the graph into at least k connected components. The minimum weight k-cut can be computed in n O(k) time, but when k is treated as part of the input, computing the minimum weight k-cut is NP-Hard [18]. For poly(m, n, k)-time algorithms, the best possible approximation factor is essentially 2 under the small set expansion hypothesis [37] . Saran and Vazirani [46] showed that a 2 − 2 k -approximately minimum weight k-cut can be
doi:10.4230/lipics.approx-random.2019.23
dblp:conf/approx/Quanrud19
fatcat:ffcftkfmlrhypb3bxm7oggfthy