A polynomial time approximation algorithm for the two-commodity splittable flow problem

We consider a generalization of the unsplittable maximum two-commodity flow problem on undirected graphs where each commodity can be split into a bounded number k i of equally-sized chunks that can be routed on different paths. We show that in contrast to the single-commodity case this problem is NP...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical methods of operations research (Heidelberg, Germany) Vol. 77; no. 3; pp. 381 - 391
Main Authors:	Eisenschmidt, Elke, Haus, Utz-Uwe
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2013 Springer Springer Nature B.V
Subjects:	Algorithms Approximation Business and Management Calculus of Variations and Optimal Control; Optimization Commodities Graphs Marketing Mathematical analysis Mathematics Mathematics and Statistics Operations research Operations Research/Decision Theory Original Article Restrictions Studies Surface hardness Splittable flow Approximation algorithm 2-commodity flow
ISSN:	1432-2994, 1432-5217
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!