Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14449
For citation please use:
Main Title: Single-source k-splittable min-cost flows
Author(s): Salazar, Fernanda
Skutella, Martin
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15676
http://dx.doi.org/10.14279/depositonce-14449
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Motivated by a famous open question on the single-source unsplittable minimum cost flow problem, we present a new approximation result for the relaxation of the problem where, for a given number k, each commodity must be routed along at most k paths.
Subject(s): approximation algorithm
multi-commodity flow
network flow
routing
unsplittable flow
k-splittable flow
Issue Date: 2009
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2009, 02
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-002-2009.pdf
Format: Adobe PDF | Size: 133.28 kB
DownloadShow Preview
Thumbnail

Item Export Bar

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