Abstract
Given a (directed) 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 consider fundamental directed connectivity network design problems under the power minimization criteria: the k-outconnected and the k-connected spanning subgraph problems. For k = 1 these problems are at least as hard as the Set-Cover problem and thus have an Ω(ln |V|) approximation threshold, while for arbitrary k a polylogarithmic approximation algorithm is unlikely. We give an O(ln |V|)-approximation algorithm for any constant k. In fact, our results are based on a much more general O(ln |V|)-approximation algorithm for the problem of finding a min-power edge-cover of an intersecting set-family; a set-family \({\cal F}\) on a groundset V is intersecting if \(X \cap Y,X \cup Y \in {\cal F}\) for any intersecting \(X,Y \in {\cal F}\), and an edge set I covers \({\cal F}\) if for every \(X \in {\cal F}\) there is an edge in I entering X.
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 in ad-hoc wireless networks. In: WCNC Proc., pp. 1889–1894 (2003)
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)
Cheriyan, J., Vempala, S., Vetta, A.: An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph. SIAM J. on Computing 32(4), 1050–1055 (2003)
Edmonds, J.: Matroid intersection. Annals of Discrete Math. 4, 185–204 (1979)
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.: Increasing the rooted-connectivity of a digraph by one. Mathematical Programming 84(3), 565–576 (1999)
Frank, A., Tardos, É.: 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 Proc., pp. 202–211 (1993)
Guha, S., Khuller, S.: Improved methods for approximating node weighted Steiner trees and connected dominating sets. Inf. Comput. 150(1), 57–74 (1999)
Hajiaghayi, M.T., Kortsarz, G., Mirokni, V.S., Nutov, Z.: Power optimization for connectivity problems. In: Jünger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol. 3509, pp. 349–361. Springer, Heidelberg (2005)
Jain, K.: A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem. Combinatorica 21(1), 39–60 (2001)
Johnson, D.S.: Approximation Algorithms for Combinatorial Problems. Journal of Computing and System Sciences 9(3), 256–278 (1974)
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)
Klein, C., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted steiner trees. Journal of Algorithms 19(1), 104–115 (1995)
Kortsarz, G., Mirokni, V.S., Nutov, Z., Tsanko, E.: Approximation algorithms for minimum power fault tolerant network design (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 (to appear)
Lando, Y., Nutov, Z.: On hardness of minimum power connectivity problems (manuscript 2006)
Nutov, Z.: Approximating minimum power connectivity problems (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 Proc., pp. 475–484 (1997)
Williamson, D.P., Goemans, M.X., Mihail, M., Vazirani, V.V.: A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica 15, 435–454 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nutov, Z. (2006). Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2006 2006. Lecture Notes in Computer Science, vol 4110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11830924_23
Download citation
DOI: https://doi.org/10.1007/11830924_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38044-3
Online ISBN: 978-3-540-38045-0
eBook Packages: Computer ScienceComputer Science (R0)