arXiv Machine Learning
Dual-GNN Multilevel Coarsening for Maximum Independent Set
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Jul 14
GES-TSP: Graph Edge Sparsification for TSP
arXiv:2607. 09708v1 Announce Type: new Abstract: Solving large-scale instances of the Traveling Salesman Problem (TSP) exactly is computationally expensive.
Hugging Face Trending Papers
Sep 21
Dual-GNN Multilevel Coarsening for Maximum Independent Set
The maximum independent set (MIS) problem is a fundamental NP-hard combinatorial optimization problem with applications in scheduling, resource allocation, and network analysis. Exact solvers can prov...
arXiv Machine Learning
Jun 18
AGDN: Learning to Solve Traveling Salesman Problem with Anisotropic Graph Diffusion Network
arXiv:2606. 19185v1 Announce Type: new Abstract: The Traveling Salesman Problem (TSP) is a cornerstone of combinatorial optimization and arises in many practical scenarios.
arXiv Machine Learning
Aug 18
Not All Neighbors Matter: Understanding the Impact of Graph Sparsification on GNN Pipelines
arXiv:2603. 06952v2 Announce Type: replace Abstract: As graphs scale to billions of nodes and edges, graph Machine Learning workloads are constrained by the cost of multi-hop traversals over exponentially growing neighborhoods.
arXiv Machine Learning
Jul 22
Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes
arXiv:2607. 18632v1 Announce Type: new Abstract: Automated Algorithm Selection (AS) aims to improve problem-solving performance by selecting, for each problem instance, the most suitable algorithm from a predefined portfolio.
Hugging Face Trending Papers
Jul 21
Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes
Automated Algorithm Selection (AS) aims to improve problem-solving performance by selecting, for each problem instance, the most suitable algorithm from a predefined portfolio. This is particularly relevant to the Traveling Salesman Problem (TSP), where solver performance is strongly instance-dependent.