Searching for "Maximum k -Splittable s , t -Flows." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Approximation and complexity of k-splittable flows
by Ronald Koch, Martin Skutella, Ines Spenke — 2005 — In Proceedings of the third Workshop on Approximation and Online Algorithms, volume 3879 of Lecture Notes in Computer Science
…://www.math.tu-berlin.de/∼spenke/ Abstract. Given a graph with a source and a sink node, the NP –hard maximum k–splittable flow (Mk…
Cited by 4 (0 self) – Add To MetaCart

On the k-Splittable Flow Problem
by Georg Baier, Ekkehard Köhler, Martin Skutella — 2002
…. The maximum k-splittable s-t-flow problem asks for a feasible k-splittable s-t-flow of maximal value…
Cited by 13 (3 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB