An FPT Algorithm Beating 2-Approximation for k-Cut

@inproceedings{Gupta2018AnFA,
  title={An FPT Algorithm Beating 2-Approximation for k-Cut},
  author={Anupam Gupta and Euiwoong Lee and Jason Li},
  booktitle={SODA},
  year={2018}
}
In the k-Cut problem, we are given an edge-weighted graph G and an integer k, and have to remove a set of edges with minimum total weight so that G has at least k connected components. Prior work on this problem gives, for all h ∈ [2, k], a (2 − h/k)-approximation algorithm for k-cut that runs in time n. Hence to get a (2− ε)-approximation algorithm for some absolute constant ε, the best runtime using prior techniques is n. Moreover, it was recently shown that getting a (2− ε)-approximation for… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 4 times over the past 90 days. VIEW TWEETS