SOURCE-LINKED INTELLIGENCE

Dual-GNN Multilevel Coarsening for Maximum Independent Set

arXiv · AI, language, vision and robotics · article · Sep 21, 2026 · UTC

Solving large-scale instances of the Traveling Salesman Problem (TSP) exactly is computationally expensive. Researchers often employ graph sparsification methods to improve computational efficiency. Traditional sparsification methods typically rely on fixed heuristics and fail to fully exploit instance-specific structural information. In this paper, we propose Graph Edge Sparsification (GES), a learning-based sparsification approach for Euclidean TSP. By incorporating geometric structural information and combinatorial optimization technology, our proposed method adaptively generates a sparsifi

Read original source ↗ Open in workspace

recordType

paper

region

Global