arXiv (All)
open access
Improved Integrality Gap for Multicommodity Flow on Trees
We improve the best known lower bound on the integrality gap for weighted unit-demand multicommodity flow on trees from $1/4$ to $2/5$, improving on the long-standing bound of Chekuri, Mydlarz, and Shepherd~\cite{CMS}. We give the proof in two stages. First, a surprisingly simple packing lemma and a
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
- An Approximation Algorithm for Monotone Submodular Cost Allocation#1012077
- Tree-based formulation for the multi-commodity flow problem#670388
- Tree-based formulation for the multi-commodity flow problem#668323
- Algorithmic Lower Bounds: Fun with Hardness Proofs#3416
- A construction of Kakeya Sets in Arbitrary Dimension#1014769
Record · ID 985353
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