Unsplittable Multicommodity Flows in Outerplanar Graphs
Unsplittable Multicommodity Flows in Outerplanar Graphs
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.
Full version of IPCO 2025 paper
- University of Waterloo Canada
FOS: Computer and information sciences, G.1.6, Computer Science - Data Structures and Algorithms, F.2.2; G.1.6; G.2.1, G.2.1, Data Structures and Algorithms (cs.DS), F.2.2
FOS: Computer and information sciences, G.1.6, Computer Science - Data Structures and Algorithms, F.2.2; G.1.6; G.2.1, G.2.1, Data Structures and Algorithms (cs.DS), F.2.2
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!