@InProceedings{chlamtac_et_al:LIPIcs.APPROX/RANDOM.2020.41,
author = {Chlamt\'{a}\v{c}, Eden and Kolman, Petr},
title = {{How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {41:1--41:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.41},
URN = {urn:nbn:de:0030-drops-126446},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.41},
annote = {Keywords: Approximation Algorithms, Length Bounded Cuts, Cut-Flow Duality, Rounding of Linear Programms}
}