A two-stage ML pipeline unions α-Nearest and POPMUSIC candidate edges then prunes single-source edges via a classifier, cutting TSP graph density 37-47% with ≥99.69% optimal-tour recall.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Machine Learning-based Two-Stage Graph Sparsification for the Travelling Salesman Problem
A two-stage ML pipeline unions α-Nearest and POPMUSIC candidate edges then prunes single-source edges via a classifier, cutting TSP graph density 37-47% with ≥99.69% optimal-tour recall.