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

DOI10.1007/978-3-540-69507-3_35zbMath1131.68330OpenAlexW1491977267MaRDI QIDQ5448791

Markus Maier, Steffen Mecke, Dorothea Wagner

Publication date: 7 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69507-3_35

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (1)

An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths

Uses Software

• Unnamed Item

This page was built for publication: Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks