Anupam Gupta, Euiwoong Lee, Jason Li. The Karger-Stein algorithm is optimal for k-cut. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath 0001, Julia Chuzhoy, editors, Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020. pages 473-484, ACM, 2020. [doi]
@inproceedings{GuptaLL20,
title = {The Karger-Stein algorithm is optimal for k-cut},
author = {Anupam Gupta and Euiwoong Lee and Jason Li},
year = {2020},
doi = {10.1145/3357713.3384285},
url = {https://doi.org/10.1145/3357713.3384285},
researchr = {https://researchr.org/publication/GuptaLL20},
cites = {0},
citedby = {0},
pages = {473-484},
booktitle = {Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020},
editor = {Konstantin Makarychev and Yury Makarychev and Madhur Tulsiani and Gautam Kamath 0001 and Julia Chuzhoy},
publisher = {ACM},
isbn = {978-1-4503-6979-4},
}