Unsplittable Multicommodity Flows in Outerplanar Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915293375234048 |
|---|---|
| author | Alemán-Espinosa, David Kumar, Nikhil |
| author_facet | Alemán-Espinosa, David Kumar, Nikhil |
| contents | We consider the problem of multicommodity flows in outerplanar graphs. Okamura and Seymour showed that the cut-condition is sufficient for routing demands in outerplanar graphs. We consider the unsplittable version of the problem and prove that if the cut-condition is satisfied, then we can route each demand along a single path by exceeding the capacity of an edge by no more than $\frac{18}{5} \cdot d_{max}$, where $d_{max}$ is the value of the maximum demand. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_13635 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Unsplittable Multicommodity Flows in Outerplanar Graphs Alemán-Espinosa, David Kumar, Nikhil Data Structures and Algorithms F.2.2; G.1.6; G.2.1 We consider the problem of multicommodity flows in outerplanar graphs. Okamura and Seymour showed that the cut-condition is sufficient for routing demands in outerplanar graphs. We consider the unsplittable version of the problem and prove that if the cut-condition is satisfied, then we can route each demand along a single path by exceeding the capacity of an edge by no more than $\frac{18}{5} \cdot d_{max}$, where $d_{max}$ is the value of the maximum demand. |
| title | Unsplittable Multicommodity Flows in Outerplanar Graphs |
| topic | Data Structures and Algorithms F.2.2; G.1.6; G.2.1 |
| url | https://arxiv.org/abs/2505.13635 |