Research map / Graph learning / Graph algorithms and clustering
A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems
Check your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use AMP instead of HBP or DD | Graph matching · car, motor, and worms | primal/dual gap | Helped |
| Use AMP instead of DD | Graph matching · worms | primal/dual gap | Helped |
| Use MP-C instead of MC-ILP | Multicut · knott-3d-{150|300|450} | dual lower bound convergence speed | Helped |
| Use MP-C instead of CGC and CC-Fusion | Multicut · knott-3d-{150|300|450} | primal solution quality | Mixed |
Closest papers by meaning
- A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching (CVPR 2017 · similarity 0.91)
- COMBHelper: A Neural Approach to Reduce Search Space for Graph Combinatorial Problems (AAAI 2024 · similarity 0.85)
- Are Graph Neural Networks Optimal Approximation Algorithms? (NeurIPS 2024 · similarity 0.85)
- Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning (AAAI 2025 · similarity 0.85)
- $\texttt{STRCMP}$: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization (NeurIPS 2025 · similarity 0.85)
- Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover (AAAI 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.