arXiv (All)
open access
Minimum-makespan completion and vertex selection leave the Wang-Sitters constant at 11/6
The 11/6 worst-case constant of the Wang-Sitters rounding scheme, which a companion note establishes, can naturally be attributed to the freedom in Step 3, where an arbitrary valid slot matching is permitted. We show that eliminating that freedom does not improve the constant. A minimum-makespan com
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
- Perfect Matching in $k$-Partite $k$-Uniform Hypergraphs#1141333
- The least signless Laplacian eigenvalue of $\{C_3,C_5\}$-free graphs#1155810
- Matching complements in subcubic graphs and a proof of the 3-Decomposition Conjecture#926194
- Parity Tests under Ties: A One-Test Lifting Theorem#1117130
- The Complexity of Recognizing SDP Exactness for the Maximum Cut Problem#1123200
Record · ID 996802
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