Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint

DOI10.1007/978-3-540-69903-3_11zbMath1155.90463DBLPconf/swat/BodlaenderTDL08OpenAlexW1484297252WikidataQ59567741 ScholiaQ59567741MaRDI QIDQ3512451

Thomas C. van Dijk, Jan van Leeuwen, Richard B. Tan, 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

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

Related Items (3)

An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems ⋮ Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint ⋮ The Maximum Energy-Constrained Dynamic Flow Problem

Cites Work

• Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
• Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
• Exact and approximate balanced data gathering in energy-constrained sensor networks
• Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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