scientific article; zbMATH DE number 2038726

zbMath1060.90512MaRDI QIDQ4449191

Alex Hall, Steffen Hippler

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190397.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexitynetwork flowroutingefficient algorithmflow over timedynamic flow

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items (5)

Multicommodity flows over time: Efficient algorithms and complexity ⋮ A polynomial time algorithm for the minimum flow problem in time-varying networks ⋮ Universal Packet Routing with Arbitrary Bandwidths and Transit Times ⋮ Minimum flow problem on network flows with time-varying bounds ⋮ Minimum-cost dynamic flows: The series-parallel case

This page was built for publication: