A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Karger used spanning tree packings to derive a near linear-time randomized algorithm for the global minimum cut problem as well as a bound on the number of approximate minimum cuts. This is a different approach from his well-known random contraction algorithm. Thorup developed a fast deterministic algorithm for the minimum k-cut problem via greedy recursive tree packings. In this paper we revisit properties of an LP relaxation for k-cut proposed by Naor and Rabani, and analyzed by Chekuri, GuhaarXiv:1808.05765v1 fatcat:awo67yx7g5bahoo6cy5eff2pou