The Maximum Energy-Constrained Dynamic Flow Problem
From MaRDI portal
Publication:3512452
DOI10.1007/978-3-540-69903-3_12zbMath1155.68561OpenAlexW1492960402MaRDI QIDQ3512452
Alexander Kröller, Sándor P. Fekete, Ekkehard Köhler, Alexander Hall
Publication date: 15 July 2008
Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_12
Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- A survey of dynamic network flows
- Efficient continuous-time dynamic network flow algorithms
- Multicommodity flows over time: Efficient algorithms and complexity
- The Quickest Transshipment Problem
- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
- Deterministic boundary recognition and topology extraction for large sensor networks
- The quickest flow problem
- Distributed Computing: A Locality-Sensitive Approach
- Minimum cost dynamic flows: The series-parallel case
- Constructing Maximal Dynamic Flows from Static Flows
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- Quickest Flows Over Time
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Maximum Energy-Constrained Dynamic Flow Problem