Abstract
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 min-power 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.
This research was supported by The Open University of Israel’s Research Fund, grant no. 46102.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Althaus, E., Calinescu, G., Mandoiu, I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks. Wireless Networks 12(3), 287–299 (2006)
Auletta, V., Dinitz, Y., Nutov, Z., Parente, D.: A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph. Journal of Algorithms 32(1), 21–30 (1999)
Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad hoc wireless networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 114–126. Springer, Heidelberg (2003)
Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Energy-efficient wireless network design. Theory of Computing Systems 39(5), 593–617 (2006)
Cheriyan, J., Jordán, T., Nutov, Z.: On rooted node-connectivity problems. Algorithmica 30(3), 353–375 (2001)
Cheriyan, J., Vempala, S., Vetta, A.: An approximation algorithm for the minimum-cost k-vertex connected subgraph. SIAM Journal on Computing 32(4), 1050–1055 (2003)
Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Scrijver, A.: Combinatorial Optimization. Wiley, Chichester (1998)
Dinitz, Y., Nutov, Z.: A 3-approximation algorithm for finding an optimum 4,5-vertex-connected spanning subgraph. Journal of Algorithms 32(1), 31–40 (1999)
Edmonds, J.: Matroid intersection. Annals of discrete Math., 185–204 (1979)
Feige, U., Kortsarz, G., Peleg, D.: The dense k-subgraph problem. Algorithmica 29(3), 410–421 (2001)
Frank, A.: Connectivity and network flows. In: Graham, R., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, pp. 111–177. Elsevier Science, Amsterdam (1995)
Frank, A.: Rooted k-connections in digraphs, EGRES TR No 2006-07 (2006)
Frank, A., Tardos, E.: An application of submodular flows. Linear Algebra and its Applications 114/115, 329–348 (1989)
Gabow, H.N.: A representation for crossing set families with application to submodular flow problems. In: SODA, pp. 202–211 (1993)
Hajiaghayi, M.T., Immorlica, N., Mirrokni, V.S.: Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. In: Proc. Mobile Computing and Networking (MOBICOM), pp. 300–312 (2003)
Hajiaghayi, M.T., Kortsarz, G., Mirrokni, V.S., Nutov, Z.: Power optimization for connectivity problems. Math. Programming 110(1), 195–208 (2007)
Khuller, S.: Approximation algorithms for for finding highly connected subgraphs. In: Hochbaum, D.S. (ed.) Approximation Algorithms FOR NP-Hard Problems, ch. 6, pp. 236–265. PWS (1995)
Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. Journal of the Association for Computing Machinery 41(2), 214–235 (1994)
Kortsarz, G., Mirrokni, V.S., Nutov, Z., Tsanko, E.: Approximation algorithms for minimum power degree and connectivity problems. Manuscript (2006)
Kortsarz, G., Nutov, Z.: Approximating node-connectivity problems via set covers. Algorithmica 37, 75–92 (2003)
Kortsarz, G., Nutov, Z.: Approximating k-node connected subgraphs via critical graphs. SIAM J. on Computing 35(1), 247–257 (2005)
Kortsarz, G., Nutov, Z.: Approximating minimum cost connectivity problems. In: Gonzalez, T.F. (ed.) Approximation Algorithms and Metaheuristics, ch. 58 (2007)
Nutov, Z.: Approximating minimum power covers of intersecting families and directed connectivity problems. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, Springer, Heidelberg (2006)
Nutov, Z.: Approximating Steiner networks with node weights. manuscript (2006)
Raz, R., Safra, S.: A sub-constant error-probability low-degree test and a sub-constant error-probability PCP characterization of NP. In: STOC, pp. 475–484 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lando, Y., Nutov, Z. (2007). On Minimum Power Connectivity Problems. In: Arge, L., Hoffmann, M., Welzl, E. (eds) Algorithms – ESA 2007. ESA 2007. Lecture Notes in Computer Science, vol 4698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75520-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-75520-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75519-7
Online ISBN: 978-3-540-75520-3
eBook Packages: Computer ScienceComputer Science (R0)