Skutella
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Pinning on Tight Cuts: Improved Algorithm and Bounds for Unsplittable Multicommodity Flows in Outerplanar Graphs
arXiv:2606.04456v1 Announce Type: new Abstract: The multicommodity flow problem in an undirected capacitated graph $G$ is specified by a set of source-sink pairs with nonnegative demands. A flow is feasible if it routes all demands without exceeding the edge capacities, and it is unsplittable if it routes each demand along a single path. Let $\alpha$ be the smallest value such that the existence of a feasible flow implies the existence of an unsplittable flow that exceeds the edge capacities...