Given a (directed or undirected) graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its nodes. Motivated by applications for wireless networks, we present improved approximation algorithms and inapproximability results for some classic network design problems under the power minimization criteria. In particular, we give a logarithmic approximation algorithm for the problem of finding a rninpower subgraph that contains k internally-disjoint paths from a given node s to every other node, and show that several other problems are unlikely to admit a polylogarithmic approximation.
|Title of host publication||Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings|
|Number of pages||12|
|State||Published - 2007|
|Event||15th Annual European Symposium on Algorithms, ESA 2007 - Eilat, Israel|
Duration: 8 Oct 2007 → 10 Oct 2007
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||15th Annual European Symposium on Algorithms, ESA 2007|
|Period||8/10/07 → 10/10/07|
Bibliographical noteFunding Information:
This research was supported by The Open University of Israel's Research Fund, grant no. 46102.