科研速览 · Science Skim继续刷下去 · Keep skimming →
◇ Open MIND2026-07-31· Enumeration

Supplementary material for: Graph balancing: tight instances for the configuration linear program and the Wang–Sitters rounding

Adam Shavit

原始摘要(英文原文)· Original abstract
Replication material for work on the configuration linear program and on rounding for **graph balancing** — scheduling on unrelated machines where every job may run on at most two of them. The main deposit accompanies a note locating the smallest and the unique instances on which the configuration linear program's integrality gap reaches 3/2, and closing the landscape of such instances machine count by machine count. A second deposit, for a companion note on the Wang–Sitters 11/6 rounding, is also stored here. Each is a replication set, not a working directory: scripts, the artifacts they write, run logs, a driver that regenerates everything, and pinned dependency versions, with a README mapping every claim to the command and artifact that establish it.
读原文 · Read the paper ↗

AI 追问PRO

登录后使用 AI 追问

讨论区

登录后参与讨论

相关论文 · Related

Supplementary material for: Graph balancing: tight instances for the configuration linear program and the Wang–Sitters rounding — 科研速览 Science Skim