On the single-source unsplittable flow problem
From MaRDI portal
Publication:1125608
DOI10.1007/s004930050043zbMath0947.90012OpenAlexW3014052784MaRDI QIDQ1125608
Michel X. Goemans, Naveen Garg
Publication date: 8 December 1999
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930050043
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Paths and cycles (05C38)
Related Items (27)
Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds ⋮ A faster combinatorial approximation algorithm for scheduling unrelated parallel machines ⋮ A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem ⋮ Improved algorithmic results for unsplittable stable allocation problems ⋮ An Improved Upper Bound for the Ring Loading Problem ⋮ The matroid intersection cover problem ⋮ Unnamed Item ⋮ Algebraic theory on shortest paths for all flows ⋮ Maximizing throughput in queueing networks with limited flexibility ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) ⋮ Single-Sink Multicommodity Flow with Side Constraints ⋮ Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling ⋮ An exact approach for the maximum concurrent \(k\)-splittable flow problem ⋮ On the approximation of the single source \(k\)-splittable flow problem ⋮ Stochastic Unsplittable Flows ⋮ On the minimum cost multiple-source unsplittable flow problem ⋮ Algebraic Theory on Shortest Paths for All Flows ⋮ Approximability of unsplittable shortest path routing problems ⋮ A Note on the Ring Loading Problem ⋮ Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems ⋮ Computing Nash equilibria for scheduling on restricted parallel links ⋮ Maximum edge-disjoint paths in planar graphs with congestion 2 ⋮ Single-source \(k\)-splittable min-cost flows ⋮ Minimizing Average Flow-Time ⋮ Minimum-cost single-source 2-splittable flow ⋮ Minimum-Cost Single-Source 2-Splittable Flow ⋮ Single source unsplittable flows with arc-wise lower and upper bounds
This page was built for publication: On the single-source unsplittable flow problem