Approximating the minimum-degree Steiner tree to within one of optimal
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
SIAM Journal on Computing
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Exact and approximate balanced data gathering in energy-constrained sensor networks
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Maximizing lifetime for data aggregation in wireless sensor networks
Mobile Networks and Applications
Minimum Bounded Degree Spanning Trees
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall/Crc Computer & Information Science Series)
Survivable network design with degree or order constraints
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximating minimum bounded degree spanning trees to within one of optimal
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Additive approximation for bounded degree survivable network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Additive guarantees for degree bounded directed network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Optimal information extraction in energy-limited wireless sensor networks
IEEE Journal on Selected Areas in Communications
Improved approximation algorithms for maximum lifetime problems in wireless networks
Theoretical Computer Science
Improved approximation bounds for maximum lifetime problems in wireless ad-hoc network
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
| Hi-index | 0.01 |
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 sumvu ∈ E 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 approaches 1/16 when k is large, and is not worse than 1/31. This is the first constant ratio approximation algorithm for this problem, which solves an open question from [2]. This result is based on a bicriteria approximation algorithm for a more general problem, in which we seek a minimum cost set of k pairwise edge-disjoint rs-paths (that is, a k-flow) subject to weighted degree constraints. We give a polynomial time algorithm that computes a flow of value k and violates the weighted degrees by a factor at most 4. This result is of independent interest.