Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

WAOA

2005

Springer

2005

Springer

Given a graph with a source and a sink node, the NP–hard maximum k–splittable ﬂow (MkSF) problem is to ﬁnd a ﬂow of maximum value with a ﬂow decomposition using at most k paths [6]. The multicommodity variant of this problem is a natural generalization of disjoint paths and unsplittable ﬂow problems. Constructing a k–splittable ﬂow requires two interdepending decisions. One has to decide on k paths (routing) and on the ﬂow values on these paths (packing). We give eﬃcient algorithms for computing exact and approximate solutions by decoupling the two decisions into a ﬁrst packing step and a second routing step. Our main contributions are as follows: (i) We show that for constant k a polynomial number of packing alternatives containing at least one packing used by an optimal MkSF solution can be constructed in polynomial time. If k is part of the input, we obtain a slightly weaker result. In this case we can guarantee that, for any ﬁxed > 0, the computed set o...

Related Content

Added |
28 Jun 2010 |

Updated |
28 Jun 2010 |

Type |
Conference |

Year |
2005 |

Where |
WAOA |

Authors |
Ronald Koch, Martin Skutella, Ines Spenke |

Comments (0)