On the single-source unsplittable flow problem

DOI10.1007/S004930050043MaRDI QIDQ1125608zbMATH OpenOpenAlexFDO

Authors Naveen Garg, Michel X. Goemans, Yefim Dinitz

Publication date 8 December 1999

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004930050043

zbMATH Keywords

unsplittable flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Paths and cycles (05C38)

Recommendations

• Approximation algorithms for single-source unsplittable flow
• On the approximation of the single source \(k\)-splittable flow problem
• Implementing approximation algorithms for the single-source unsplittable flow problem
• Approximating the single source unsplittable min-cost flow problem
• On the minimum cost multiple-source unsplittable flow problem
• Approximation algorithms for the unsplittable flow problem
• scientific article; zbMATH DE number 1947047
• Improved bounds for the unsplittable flow problem
• New Algorithms for the Unsplittable Flow Problem
• Combinatorial algorithms for the unsplittable flow problem

Cited in

(39)

• Convex Combinations of Single Source Unsplittable Flows
• Maximizing throughput in queueing networks with limited flexibility
• Minimizing Average Flow-Time
• The matroid intersection cover problem
• scientific article; zbMATH DE number 1775441 (Why is no real title available?)
• Single-Sink Multicommodity Flow with Side Constraints
• Network models with unsplittable node flows with application to unit train scheduling
• Congestion-free rerouting of flows on DAGs
• Algebraic theory on shortest paths for all flows
• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
• Single source unsplittable flows with arc-wise lower and upper bounds
• Stochastic unsplittable flows
• Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
• Algorithms – ESA 2004
• The inapproximability of maximum single-sink unsplittable, priority and confluent flow problems
• Truthful unsplittable flow for large capacity networks
• On the minimum cost multiple-source unsplittable flow problem
• Approximability of unsplittable shortest path routing problems
• Approximating the single source unsplittable min-cost flow problem
• The \(k\)-splittable flow problem
• scientific article; zbMATH DE number 7121921 (Why is no real title available?)
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
• An exact approach for the maximum concurrent \(k\)-splittable flow problem
• Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
• Maximum edge-disjoint paths in planar graphs with congestion 2
• Single-source \(k\)-splittable min-cost flows
• Minimum-cost single-source 2-splittable flow
• Improved algorithmic results for unsplittable stable allocation problems
• Computing Nash equilibria for scheduling on restricted parallel links
• On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
• Single source unsplittable flows with arc-wise lower and upper bounds
• A note on the ring loading problem
• Approximation algorithms for single-source unsplittable flow
• scientific article; zbMATH DE number 1947047 (Why is no real title available?)
• An improved upper bound for the ring loading problem
• Cluster before you hallucinate: node-capacitated network design and energy efficient routing
• On the approximation of the single source \(k\)-splittable flow problem
• Minimum-Cost Single-Source 2-Splittable Flow
• Algebraic theory on shortest paths for all flows

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1125608)