An FPTAS for flows over time with aggregate arc capacities

DOI10.1007/978-3-642-18318-8_10MaRDI QIDQ3075454zbMATH OpenOpenAlexFDO

Authors Daniel Dressler, Martin Skutella

Publication date 15 February 2011

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18318-8_10

zbMATH Keywords

approximation algorithmarc capacitydynamic flownetwork flow

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic network models in operations research (90B10)

Recommendations

• 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
• An approximation algorithm for discrete minimum cost flows over time problem

Cited in

(1)

• On the approximability of train routing and the min-max disjoint paths problem

This page was built for publication: An FPTAS for flows over time with aggregate arc capacities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075454)