Reproduce “Edge-wise Topological Divergence Gaps: Guiding Search in Combinatorial Optimization” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Ilya Trofimov, Daria Voronkova, Alexander Mironenko, Anton Dmitriev, Eduard Tulchinskii, Evgeny Burnaev, Serguei Barannikov
The authors use RTDL-guided 2-opt to prioritize route edges by their multiscale connectivity gaps from a minimum spanning tree (MST); a theorem shows the nonnegative gaps sum to the tour–MST length difference. On DIFUSCO heatmap-decoded TSP-10000 tours, mean length falls from 75.87 to 74.28 and optimization time from 7,027.63 to 865.5 seconds across 16 instances, not establishing faster results in every setting.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.