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




Related Items (27)

Single Source Unsplittable Flows with Arc-Wise Lower and Upper BoundsA faster combinatorial approximation algorithm for scheduling unrelated parallel machinesA fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problemImproved algorithmic results for unsplittable stable allocation problemsAn Improved Upper Bound for the Ring Loading ProblemThe matroid intersection cover problemUnnamed ItemAlgebraic theory on shortest paths for all flowsMaximizing throughput in queueing networks with limited flexibilityCombinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)Single-Sink Multicommodity Flow with Side ConstraintsNetwork Models with Unsplittable Node Flows with Application to Unit Train SchedulingAn exact approach for the maximum concurrent \(k\)-splittable flow problemOn the approximation of the single source \(k\)-splittable flow problemStochastic Unsplittable FlowsOn the minimum cost multiple-source unsplittable flow problemAlgebraic Theory on Shortest Paths for All FlowsApproximability of unsplittable shortest path routing problemsA Note on the Ring Loading ProblemNear-optimal hardness results and approximation algorithms for edge-disjoint paths and related problemsComputing Nash equilibria for scheduling on restricted parallel linksMaximum edge-disjoint paths in planar graphs with congestion 2Single-source \(k\)-splittable min-cost flowsMinimizing Average Flow-TimeMinimum-cost single-source 2-splittable flowMinimum-Cost Single-Source 2-Splittable FlowSingle source unsplittable flows with arc-wise lower and upper bounds






This page was built for publication: On the single-source unsplittable flow problem