Sciweavers

Share
SOFSEM
2007
Springer

Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks

10 years 1 months ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A polynomial algorithm which guarantees a factor-k-approximation for this problem has been presented before, but its complexity status was open. In this paper we prove that MEEP is NP-hard and give new lower and upper bounds on the approximation factor of the k-approximation algorithm. For MEEP on acyclic graphs we introduce an exact, polynomial algorithm which is then extended to a heuristic for arbitrary graphs.
Markus Maier, Steffen Mecke, Dorothea Wagner
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where SOFSEM
Authors Markus Maier, Steffen Mecke, Dorothea Wagner
Comments (0)
books