scientific article; zbMATH DE number 2038726
From MaRDI portal
Publication:4449191
zbMATH Open1060.90512MaRDI QIDQ4449191FDOQ4449191
Authors: Alex Hall, Steffen Hippler, Martin Skutella 
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190397.htm
Title of this publication is not available (Why is that?)
Recommendations
- Multicommodity flows over time: Efficient algorithms and complexity
- An FPTAS for quickest multicommodity flows with inflow-dependent transit times
- An FPTAS for quickest multicommodity flows with inflow-dependent transit times
- Maximum multicommodity flows over time without intermediate storage
- Quickest Flows Over Time
Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18)
Cited In (15)
- Minimum flow problem on network flows with time-varying bounds
- The Access-Control Problem on Capacitated FIFO Networks With Unique O-D Paths is Hard
- Multi-commodity flow problem on lossy network with partial lane reversals
- Multicommodity flows over time: Efficient algorithms and complexity
- A polynomial time algorithm for the minimum flow problem in time-varying networks
- An approximation algorithm for discrete minimum cost flows over time problem
- An FPTAS for quickest multicommodity flows with inflow-dependent transit times
- Minimum-cost dynamic flows: The series-parallel case
- Universal packet routing with arbitrary bandwidths and transit times
- Online Multi-Commodity Flow with High Demands
- Title not available (Why is that?)
- Speeding up Karmarkar's algorithm for multicommodity flows
- One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs
- An exact algorithm for a multicommodity min-cost flow over time problem
- Heterogeneous multi-commodity network flows over time
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449191)
