Join Our Newsletter

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

TAMC

2009

Springer

2009

Springer

In classical network ﬂow theory the choice of paths, on which ﬂow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many problems restrict, e.g., the number of paths being used to route a commodity. One idea to increase reliability of routings, e.g., in telecommunication, is to copy a demand and send the copies along disjoint paths. Such problems theoretically result in the kdisjoint ﬂow problem (k-DFP). This problem is a variant of the classical multicommodity ﬂow problem with the additional requirement that the number of paths to route a commodity is bounded by a given parameter. Moreover, all paths used by the same commodity have to be arc disjoint. We present a simple greedy algorithm for the optimization version of the k-DFP where the objective is to maximize the sum of routed demands. This algorithm generalizes a greedy algorithm by Kolman and Scheideler (2002) that approximates the corresponding unsplittable ﬂow proble...

Related Content

Added |
27 May 2010 |

Updated |
27 May 2010 |

Type |
Conference |

Year |
2009 |

Where |
TAMC |

Authors |
Maren Martens |

Comments (0)