The paper states the original congestion theorem, Goemans’ cost-enhanced conjecture and a planar theorem with twice the largest-demand allowance.
Source publication and attributed assessments are distinct from independent OpenMath review.
The exact passages cited in OpenMath. Each passage identifies how its wording was recorded.
The paper states the original congestion theorem, Goemans’ cost-enhanced conjecture and a planar theorem with twice the largest-demand allowance.
Passage ID: dinitz-garg-goemans-flow:entry:literature:v1
Source item: literature
Source record: dinitz-garg-goemans-flow:source:literature:v1
Explicit citations in versioned problem publications. A citation records a use; it does not confer proof or independent verification.
Problem publication v9
Source assessment
Proved
Original congestion-only theorem
No cost-preservation assertion.
Source date Aug 4, 2023 · Observed Oct 13, 2026
Source assessment
Proved
Planar cost theorem with doubled allowance
Planar instances with upper and lower deviation at most 2 d_max.
Source date Aug 4, 2023 · Observed Oct 13, 2026
Definition
Unsplittable routing
History
The original congestion theorem
History
A planar theorem preserves cost with a larger allowance
Question
Cost-preserving unsplittable flow
Further reading
Consult the original question and its hypotheses.
Recorded authorship
Vera Traub · Laura Vargas Koch · Rico Zenklusen
Vera Traub, Laura Vargas Koch, Rico Zenklusen
No specific AI contribution is attributed by this source record.
OpenMath source records preserve exact citations. Observation dates order these records; they do not establish the latest upstream paper or proof.
Single-Source Unsplittable Flows in Planar Graphs
OpenMath supplies its own mathematical paraphrases and links; proof text is not republished.
Source terms ↗