Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14742
For citation please use:
Main Title: On the <I>k</I>-splittable Flow Problem
Author(s): Baier, Georg
Köhler, Ekkehard
Skutella, Martin
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15969
http://dx.doi.org/10.14279/depositonce-14742
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: In traditional multi-commodity flow theory, the task is to send a certain amount of each commodity from its start to its target node, subject to capacity constraints on the edges. However, no restriction is imposed on the number of paths used for delivering each commodity; it is thus feasible to spread the flow over a large number of different paths. Motivated by routing problems arising in real-life applications, such as, e.g., telecommunication, unsplittable flows have moved into the focus of research. Here, the demand of each commodity may not be split but has to be sent along a single path.
Subject(s): approximation algorithms
graph algorithms
network flow
routing
Issue Date: 2002
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 90C27 Combinatorial optimization
90B10 Network models, deterministic
90C35 Programming involving graphs or networks
05C38 Paths and cycles
05C85 Graph algorithms
90C59 Approximation methods and heuristics
68W25 Approximation algorithms
68Q25 Analysis of algorithms and problem complexity
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2002, 739
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-739-2002.pdf
Format: Adobe PDF | Size: 15.07 MB
DownloadShow Preview
Thumbnail
Report-739-2002.ps.gz
Format: Unknown | Size: 109.79 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.