English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times

Hall, A., Langkau, K., & Skutella, M. (2003). An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. In Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003 (pp. 71-82). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2C27-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2C2A-1
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Hall, Alex, Author
Langkau, Katharina, Author
Skutella, Martin1, Author           
Arora, Sanjeev, Editor
Jansen, Klaus1, Editor           
Rolim, Jose D. P., Editor
Sahai, Amit, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 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 an FPTAS for the quickest multicommodity flow problem with bounded cost.

Details

show
hide
Language(s): eng - English
 Dates: 2004-06-172003
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 202043
Other: Local-ID: C1256428004B93B8-91589E2EDD7B2533C1256E20003753CF-HallLangkauSkutella2003
 Degree: -

Event

show
hide
Title: RANDOM APPROX 2003
Place of Event: Princeton, USA
Start-/End Date: 2003-08-24 - 2003-08-26

Legal Case

show

Project information

show

Source 1

show
hide
Title: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 71 - 82 Identifier: ISBN: 3-540-40770-7

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2764 Sequence Number: - Start / End Page: - Identifier: -