Flows with Unit Path Capacities and Related Packing and Covering Problems

Simple item page
dc.contributor.authorMartens, Maren
dc.contributor.authorSkutella, Martin
dc.date.accessioned2021-12-17T10:07:54Z
dc.date.available2021-12-17T10:07:54Z
dc.date.issued2008
dc.description.abstractSince the seminal work of Ford and Fulkerson in the 1950s, network flow theory is one of the most important and most active areas of research in combinatorial optimization. Coming from the classical maximum flow problem, we introduce and study an apparently basic but new flow problem that features a couple of interesting peculiarities. We derive several results on the complexity and approximability of the new problem. On the way we also discover two closely related basic covering and packing problems that are of independent interest.en
dc.identifier.issn2197-8085
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/15639
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-14412
dc.language.isoenen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.ddc510 Mathematiken
dc.subject.othernetwork flowsen
dc.subject.otherpackingen
dc.subject.othercoveringen
dc.subject.otherapproximationen
dc.titleFlows with Unit Path Capacities and Related Packing and Covering Problemsen
dc.typeResearch Paperen
dc.type.versionsubmittedVersionen
tub.accessrights.dnbfreeen
tub.affiliationFak. 2 Mathematik und Naturwissenschaften::Inst. Mathematikde
tub.affiliation.facultyFak. 2 Mathematik und Naturwissenschaftende
tub.affiliation.instituteInst. Mathematikde
tub.publisher.universityorinstitutionTechnische Universität Berlinen
tub.series.issuenumber2008, 21en
tub.series.namePreprint-Reihe des Instituts für Mathematik, Technische Universität Berlinen
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Report-021-2008.pdf
Size:
158.11 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Publications