Minimum-cost single-source 2-splittable flow
type: Item
instance of: scholarly article
title: Minimum-cost single-source 2-splittable flow
zbMATH Open document ID: 1182.68362
author: Stavros G. Kolliopoulos
published in: Information Processing Letters
publication date: 2009-12-04T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5642313
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: approximation algorithms
zbMATH Keywords: graph algorithms
zbMATH Keywords: maximum flow
zbMATH Keywords: unsplittable flow
MaRDI profile type: Publication
full work available at URL: j.ipl.2004.12.009
OpenAlex ID: W2107700597
cites work: On the single-source unsplittable flow problem
cites work: NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
cites work: Approximation algorithms for single-source unsplittable flow
cites work: Approximating disjoint-path problems using packing integer programs
cites work: An approximation algorithm for the generalized assignment problem
cites work: Approximating the single source unsplittable min-cost flow problem
DOI: 10.1016/J.IPL.2004.12.009
Recommended article: Minimum-Cost Single-Source 2-Splittable Flow
Recommended article: Single-source \(k\)-splittable min-cost flows
Recommended article: Approximating the single source unsplittable min-cost flow problem
Recommended article: On the minimum cost multiple-source unsplittable flow problem
Recommended article: Send-and-Split Method for Minimum-Concave-Cost Network Flows
Recommended article: On dual minimum cost flow algorithms
Recommended article: Minimum cost multiflows in undirected networks
Recommended article: Minimum-cost flows in unit-capacity networks
Recommended article: Q4884528
Recommended article: Q5240196
description: scientific article; zbMATH DE number 5642313