arXiv (OAI Expanded)
open access
The Complexity of Recognizing SDP Exactness for the Maximum Cut Problem
The standard semidefinite programming (SDP) relaxation of Max-Cut is exact when its optimum equals the maximum cut value. Delorme and Poljak resolved NP-completeness of recognizing exactness for weighted graphs and left the unweighted case open. We show that recognition is NP-complete even for conne
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
- Sparse Cuts for the Positive Semidefinite Cone#793594
- Sparse Cuts for the Positive Semidefinite Cone#789590
- Parameterized Hardness of Mixed 2-Sided Orthant Depth#1144885
- Multiobjective Hypergraph Min-Cut in Quasi-Polynomial Time#927682
- Linear-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting#1077253
Record · ID 1123200
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