תקציר
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.
שפה מקורית | אנגלית |
---|---|
כותר פרסום המארח | Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings |
מוציא לאור | Springer Verlag |
עמודים | 87-98 |
מספר עמודים | 12 |
מסת"ב (מודפס) | 9783540755197 |
מזהי עצם דיגיטלי (DOIs) | |
סטטוס פרסום | פורסם - 2007 |
אירוע | 15th Annual European Symposium on Algorithms, ESA 2007 - Eilat, ישראל משך הזמן: 8 אוק׳ 2007 → 10 אוק׳ 2007 |
סדרות פרסומים
שם | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
כרך | 4698 LNCS |
ISSN (מודפס) | 0302-9743 |
ISSN (אלקטרוני) | 1611-3349 |
כנס
כנס | 15th Annual European Symposium on Algorithms, ESA 2007 |
---|---|
מדינה/אזור | ישראל |
עיר | Eilat |
תקופה | 8/10/07 → 10/10/07 |
הערה ביבליוגרפית
Funding Information:This research was supported by The Open University of Israel's Research Fund, grant no. 46102.