The Maximum Energy-Constrained Dynamic Flow Problem

DOI10.1007/978-3-540-69903-3_12MaRDI QIDQ3512452zbMATH OpenOpenAlexFDO

Authors Sándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Recommendations

• Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
• Dealing with residual energy when transmitting data in energy-constrained capacitated networks
• The energy-constrained quickest path problem
• Constructing maximal dynamic flows from static flows
• The maximum flow in dynamic networks

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 5506240 (Why is no real title available?)
• scientific article; zbMATH DE number 1024734 (Why is no real title available?)
• scientific article; zbMATH DE number 956788 (Why is no real title available?)
• A survey of dynamic network flows
• Constructing maximal dynamic flows from static flows
• Deterministic boundary recognition and topology extraction for large sensor networks
• Distributed Computing: A Locality-Sensitive Approach
• Efficient continuous-time dynamic network flow algorithms
• Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
• Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
• Minimum cost dynamic flows: the series-parallel case
• Multicommodity flows over time: Efficient algorithms and complexity
• Quickest Flows Over Time
• The quickest flow problem
• The quickest transshipment problem

Cited in

(8)

• An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems
• Dealing with residual energy when transmitting data in energy-constrained capacitated networks
• Algorithms and Simulation Methods for Topology-Aware Sensor Networks
• Energy-minimising parallel flows with prescribed vorticity distribution
• Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
• Maximum flow under proportional delay constraint
• Minimum-peak-cost flows over time
• Depletable channels: dynamics, behaviour, and efficiency in network design

This page was built for publication: The Maximum Energy-Constrained Dynamic Flow Problem

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