@InProceedings{quanrud:LIPIcs.APPROX-RANDOM.2019.23,
author = {Quanrud, Kent},
title = {{Fast and Deterministic Approximations for k-Cut}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {23:1--23:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.23},
URN = {urn:nbn:de:0030-drops-112388},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.23},
annote = {Keywords: k-cut, multiplicative weight updates}
}