arXiv (All)
open access
A minimum witness for the 3/2 configuration-linear-program gap in two-weight graph balancing, unique at its size
In restricted assignment - makespan minimization where each job has one size and a set of allowed machines - the configuration LP is the tightest studied relaxation, and its integrality gap is open in general. On two-weight graph balancing - each job allowed on at most two machines, sizes from two v
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
- The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing#998384
- Odd Cycle Transversal on $H$-free graphs#1105459
- Perfect Matching in $k$-Partite $k$-Uniform Hypergraphs#1141333
- Matching complements in subcubic graphs and a proof of the 3-Decomposition Conjecture#926194
- Replica Thresholds for Stripeless Erasure Coding Based on Symmetric Block Designs#1077078
Record · ID 999284
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