Sciweavers

Share
DIALM
2008
ACM

Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows

9 years 5 days ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }, and two nodes r, s V , find a maximum integral rs-flow f so that for every node v its energy consumption P vuE f(vu)w(vu) is at most b(v). Let k be the maximum integral flow value. We give a polynomial time algorithm that computes a flow of value at least k/16 . As checking whether k 1 can be done in polynomial time, this gives an approximation algorithm with ratio that ap
Zeev Nutov
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where DIALM
Authors Zeev Nutov
Comments (0)
books