Machine Learning for Two-Stage Graph Sparsification for the Travelling Salesman Problem
DGX agentarXiv:2604.20236v1 Announce Type: new Abstract: High-performance TSP solvers like LKH search within a sparsified candidate graph rather than over all possible edges. Graph sparsification is non-trivia