Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14244
For citation please use:
Main Title: The Quickest Multicommodity Flow Problem
Author(s): Fleischer, Lisa
Skutella, Martin
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15471
http://dx.doi.org/10.14279/depositonce-14244
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Traditionally, flows over time are solved in time expanded networks which contain one copy of the original network for each discrete time step. While this method makes available the whole algorithmic toolbox developed for static flows, its main and often fatal drawback is the enormous size of the time expanded network. In particular, this approach usually does not lead to efficient algorithms with running time polynomial in the input size since the size of the time expanded network is only pseudo-polynomial.
Subject(s): approximation algorithms
dynamic flow
flow over time
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, 728
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-728-2002.pdf
Format: Adobe PDF | Size: 256.92 kB
DownloadShow Preview
Thumbnail
Report-728-2002.ps.gz
Format: Unknown | Size: 96.37 kB
Download

Item Export Bar

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