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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical methods of operations research (Heidelberg, Germany) Ročník 77; číslo 3; s. 381 - 391
Hlavní autoři:	Eisenschmidt, Elke, Haus, Utz-Uwe
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2013 Springer Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!