An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
| dc.contributor.author | Hall, Alex | |
| dc.contributor.author | Langkau, Katharina | |
| dc.contributor.author | Skutella, Martin | |
| dc.date.accessioned | 2021-12-17T10:05:34Z | |
| dc.date.available | 2021-12-17T10:05:34Z | |
| dc.date.issued | 2003 | |
| dc.description.abstract | Given a network with capacities and transit times on the arcs, the quickest flow problem asks for a "flow over time" that satisfies given demands within minimal time. In the setting of flows over time, flow on arcs may vary over time and the transit time of an arc is the time it takes for flow to travel through this arc. In most real-world applications (such as, e.g., road traffic, communication networks, production systems, etc.), transit times are not fixed but depend on the current flow situation in the network. We consider the model where the transit time of an arc is given as a nondecreasing function of the rate of inflow into the arc. We prove that the quickest s-t-flow problem is NP-hard in this setting and give various approximation results, including a fully polynomial time approximation scheme (FPTAS) for the quickest multicommodity flow problem with bounded cost. | en |
| dc.identifier.issn | 2197-8085 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/15495 | |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-14268 | |
| 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 algorithms | en |
| dc.subject.other | dynamic flow | en |
| dc.subject.other | flow over time | en |
| dc.subject.other | graph algorithms | en |
| dc.subject.other | network flow | en |
| dc.subject.other | routing | en |
| dc.subject.other | traffic models | en |
| dc.title | An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times | 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 | 2003, 24 | en |
| tub.series.name | Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin | en |
| tub.subject.msc2000 | 90C27 Combinatorial optimization | en |
| tub.subject.msc2000 | 90B10 Network models, deterministic | en |
| tub.subject.msc2000 | 90B20 Traffic problems | en |
| tub.subject.msc2000 | 90C35 Programming involving graphs or networks | en |
| tub.subject.msc2000 | 05C85 Graph algorithms | en |
| tub.subject.msc2000 | 90C59 Approximation methods and heuristics | en |
| tub.subject.msc2000 | 68W25 Approximation algorithms | en |
| tub.subject.msc2000 | 68Q25 Analysis of algorithms and problem complexity | en |