arXiv (All)
open access
The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing
Wang and Sitters' 11/6-approximation for graph balancing is not one algorithm but a set of permitted executions: Step 1 may return any feasible solution of the relaxation and Step 3 any of the many ways to match the remaining jobs into the slots the rounding opens. We determine exactly what that lat
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
- Dense Interprocedural Dominance in Acyclic Graphs: Context Bounds and Compact Queries#1064362
- Tight Energy Lower Bounds for Distributed Graph Algorithms#467099
- A minimum witness for the 3/2 configuration-linear-program gap in two-weight graph balancing, unique at its size#999284
- Ramsey achievement games on graphs : algorithms and bounds#796468
- Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming#819229
Record · ID 998384
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