Approximating the single source unsplittable min-cost flow problem

DOI10.1007/S101070100260MaRDI QIDQ1849529zbMATH OpenOpenAlexFDO

Authors Martin Skutella

Publication date 1 December 2002

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmnetwork flowroutingunsplittable flowmulti-commodity flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Paths and cycles (05C38)

Recommendations

• Approximation algorithms for single-source unsplittable flow
• Minimum-Cost Single-Source 2-Splittable Flow
• Minimum-cost single-source 2-splittable flow
• Implementing approximation algorithms for the single-source unsplittable flow problem
• On the single-source unsplittable flow problem

Cited in

(23)

• Single-Sink Multicommodity Flow with Side Constraints
• Single source unsplittable flows with arc-wise lower and upper bounds
• Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
• Constrained flows in networks
• On the minimum cost multiple-source unsplittable flow problem
• Approximability of unsplittable shortest path routing problems
• 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
• Single-source \(k\)-splittable min-cost flows
• Minimum-cost single-source 2-splittable flow
• An enhanced Benders decomposition method for unique shortest path routing
• Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
• NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
• Flow constrained minimum cost flow problem
• Single source unsplittable flows with arc-wise lower and upper bounds
• On the single-source unsplittable flow problem
• A note on the ring loading problem
• Approximation algorithms for single-source unsplittable flow
• An improved upper bound for the ring loading problem
• Implementing approximation algorithms for the single-source unsplittable flow problem
• On the approximation of the single source \(k\)-splittable flow problem
• Minimum-Cost Single-Source 2-Splittable Flow

This page was built for publication: Approximating the single source unsplittable min-cost flow problem

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