A Christofides-style algorithm with prediction-biased spanning trees turns any TSP edge heatmap into a tour of cost at most OPT + 2η, with near-linear-time and graphical variants plus a matching lower bound.
The traveling salesman problem on a graph and some related integer polyhedra.Math
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
TSP with Predictions: Heatmap to Tour with Provable Guarantees
A Christofides-style algorithm with prediction-biased spanning trees turns any TSP edge heatmap into a tour of cost at most OPT + 2η, with near-linear-time and graphical variants plus a matching lower bound.