@InProceedings{gurvits_et_al:LIPIcs.ICALP.2024.79,
author = {Gurvits, Leonid and Klein, Nathan and Leake, Jonathan},
title = {{From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {79:1--79:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.79},
URN = {urn:nbn:de:0030-drops-202229},
doi = {10.4230/LIPIcs.ICALP.2024.79},
annote = {Keywords: traveling salesman problem, strongly Rayleigh distributions, polynomial capacity, probability lower bounds, combinatorial lower bounds}
}