Minimum-Cost Single-Source 2-Splittable Flow

DOI10.1016/J.ENDM.2004.03.039MaRDI QIDQ3439153zbMATH OpenOpenAlexFDO

Authors Stavros G. Kolliopoulos

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2004.03.039

zbMATH Keywords

approximation algorithmsmaximum flowunsplittable flow

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• Minimum-cost single-source 2-splittable flow
• Approximating the single source unsplittable min-cost flow problem
• Approximation algorithms for single-source unsplittable flow
• Single-source \(k\)-splittable min-cost flows
• On the approximation of the single source \(k\)-splittable flow problem

Cites work

• An approximation algorithm for the generalized assignment problem
• Approximating the single source unsplittable min-cost flow problem
• Approximation algorithms for single-source unsplittable flow
• scientific article; zbMATH DE number 1947385 (Why is no real title available?)
• NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
• On the single-source unsplittable flow problem

Cited in

(5)

• Single-source \(k\)-splittable min-cost flows
• Minimum-cost single-source 2-splittable flow
• Approximating the single source unsplittable min-cost flow problem
• On the minimum cost multiple-source unsplittable flow problem
• On the approximation of the single source \(k\)-splittable flow problem

This page was built for publication: Minimum-Cost Single-Source 2-Splittable Flow

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