Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint

DOI10.1007/978-3-540-69903-3_11MaRDI QIDQ3512451zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Richard B. Tan, Thomas C. van Dijk, J. Van Leeuwen, Hans L. Bodlaender

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_11

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The Maximum Energy-Constrained Dynamic Flow Problem
• Algorithmic Aspects of Wireless Sensor Networks
• On the maximization of the lifetime of a sensor network subject to limited resources
• Latency-constrained aggregation in sensor networks
• Latency Constrained Aggregation in Sensor Networks

Cites work

• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
• Exact and approximate balanced data gathering in energy-constrained sensor networks
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 566078 (Why is no real title available?)
• scientific article; zbMATH DE number 1393308 (Why is no real title available?)
• Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
• Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
• Network flows. Theory, algorithms, and applications.

Cited in

(4)

• Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
• The Maximum Energy-Constrained Dynamic Flow Problem
• An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems
• Minimum-peak-cost flows over time

This page was built for publication: Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint

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