arXiv (All)
open access
Neural Tractability via Structure: Learning-Augmented Algorithms for Graph Combinatorial Optimization
Neural solvers provide fast solutions to graph combinatorial optimization problems, but training alone does not guarantee solution quality. Exact methods guarantee optimality but can be prohibitively expensive. We propose Neural Fixed-Parameter Tractable (N-FPT), a neural-model-agnostic framework th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Decoupled Structure-Feature Alignment via Alternating Optimization for Graph Learning#792785
- Decoupled Structure-Feature Alignment via Alternating Optimization for Graph Learning#788785
- HUANet: Hard-Constrained Unrolled ADMM for Constrained Convex Optimization#1155166
- Learning Constraints-Based Adaptive Hypergraph Neural Networks for Solving Vehicle Routing Problems#925753
- Recursive Computation of Path Homology for Stratified Digraphs#820169
Record · ID 1117280
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive