Single-source k-splittable min-cost flows

dc.contributor.author	Salazar, Fernanda
dc.contributor.author	Skutella, Martin
dc.date.accessioned	2021-12-17T10:08:42Z
dc.date.available	2021-12-17T10:08:42Z
dc.date.issued	2009
dc.description.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.	en
dc.identifier.issn	2197-8085
dc.identifier.uri	https://depositonce.tu-berlin.de/handle/11303/15676
dc.identifier.uri	http://dx.doi.org/10.14279/depositonce-14449
dc.language.iso	en	en
dc.rights.uri	http://rightsstatements.org/vocab/InC/1.0/	en
dc.subject.ddc	510 Mathematik	en
dc.subject.other	approximation algorithm	en
dc.subject.other	multi-commodity flow	en
dc.subject.other	network flow	en
dc.subject.other	routing	en
dc.subject.other	unsplittable flow	en
dc.subject.other	k-splittable flow	en
dc.title	Single-source k-splittable min-cost flows	en
dc.type	Research Paper	en
dc.type.version	submittedVersion	en
tub.accessrights.dnb	free	en
tub.affiliation	Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik	de
tub.affiliation.faculty	Fak. 2 Mathematik und Naturwissenschaften	de
tub.affiliation.institute	Inst. Mathematik	de
tub.publisher.universityorinstitution	Technische Universität Berlin	en
tub.series.issuenumber	2009, 02	en
tub.series.name	Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin	en

Now showing 1 - 1 of 1