Abstract
Given a 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 the nodes of this graph. Motivated by applications in wireless multi-hop networks, we consider four fundamental problems under the power minimization criteria: the Min-Power b-Edge-Cover problem (MPb-EC) where the goal is to find a min-power subgraph so that the degree of every node v is at least some given integer b(v), the Min-Power k-node Connected Spanning Subgraph problem (MPk-CSS), Min-Power k-edge Connected Spanning Subgraph problem (MPk-CSS), and finally the Min-Power k-Edge-Disjoint Paths problem in directed graphs (MPk-EDP). We give an O(log4 n)-approximation algorithm for MPb-EC. This gives an O(log4 n)-approximation algorithm for MPk-CSS for most values of k, improving the best previously known O(k)-approximation guarantee. In contrast, we obtain an \(O(\sqrt{n})\) approximation algorithm for ECSS, and for its variant in directed graphs (i.e., MPk-EDP), we establish the following inapproximability threshold: MPk-EDP cannot be approximated within O(2log1-ε n) for any fixed ε > 0, unless NP-hard problems can be solved in quasi-polynomial time.
Similar content being viewed by others
References
Althaus, E., Calinescu G., Mandoiu I., Prasad S., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment in ad-hoc wireless networks. In: Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), pp. 1889–1894 (2003)
Bahramgiri, M., Hajiaghayi, M., Mirrokni, V.: Fault-tolerant and 3-dimensional distributed topology control algorithms wireless multi-hop networks. In: Proceedings of the 11th IEEE International Conference on Computer Communications and Networks (ICCCN), IEEE Press, pp. 392–398 (2002)
Blough, D.M., Leoncini, M., Resta, G., Santi, P.: On the symmetric range assignment problem in wireless ad hoc networks. In: TCS ’02: Proceedings of the IFIP 17th World Computer Congress—TC1 Stream/2nd IFIP International Conference on Theoretical Computer Science, Kluwer, The Netherlands, pp. 71–82 (2002)
Calinescu, G., Mandoiu, I.I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: TCS ’02: Proceedings of the IFIP 17th World Computer Congress—TC1 Stream/2nd IFIP International Conference on Theoretical Computer Science, Kluwer, The Newtherlands, pp. 119–130 (2002)
Calinescu, G., Wan, P.-J.: Range assignment for high connectivity in wireless ad hoc network. In: Adhoc-Now, pp. 235–246 (2003)
Cheriyan J. and Thurimella R (1999). Fast algorithms for k-shredders and k-node connectivity augmentation. J. Algorithms 33: 15–50
Cheriyan, J., Vempala, S., Vetta, A.: An approximation algorithm for the minimum-cost k-vertex connected subgraph. SIAM J. Comput. 32, 1050–1055 (electronic) (2003)
Clementi, A., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.: Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. Manuscript 23–38 (2002)
Clementi, A.E.F., Penna, P., Silvestri, R.: Hardness results for the power range assignmet problem in packet radio networks. In: RANDOM-APPROX ’99: Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. Springer, Berlin Heidelberg New York, pp. 197–208 (1999)
Frank A. and Tardos É. (1989). An application of submodular flows. Linear Algebra Appl. 114(115): 329–348
Hajiaghayi, M., Immorlica, N., Mirrokni, V.S.: Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. In: MobiCom ’03: Proceedings of the 9th annual international conference on Mobile computing and networking, ACM Press, pp. 300–312 (2003)
Khuller S. and Raghavachari B. (1996). Improved approximation algorithms for uniform connectivity problems. J. Algorithms 21: 434–450
Khuller S. and Vishkin U. (1994). Biconnectivity approximations and graph carvings. J. Assoc. Comput. Mach. 41: 214–235
Kirousis L.M., Kranakis E., Krizanc D. and Pelc A. (2000). Power consumption in packet radio networks. Theoret. Comput. Sci. 243: 289–305
Kortsarz G. (2001). On the hardness of approximating spanners. Algorithmica 30: 432–450
Kortsarz G. and Nutov Z. (2003). Approximating node connectivity problems via set covers. Algorithmica 37: 75–92
Kortsarz, G., Nutov, Z.: Approximation algorithm for k-node connected subgraphs via critical graphs. In: STOC ’04: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, ACM Press, pp. 138–145 (2003)
Li, L., Halpern, J.Y., Bahl, P., Wang, Y.-M., Wattenhofer, R.: Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks. In: PODC ’01: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, ACM Press, pp. 264–273 (2001)
Lloyd E.L., Liu R., Marathe M.V., Ramanathan R. and Ravi S.S. (2005). Algorithmic aspects of topology control problems for ad hoc networks. Mob. Netw. Appl. 10: 19–34
Mader W. (1972). Ecken vom grad n in minimalen n-fach zusammenhangenden Graphen. Arch. Math. (Basel) 23: 219–224
Orlin J.B. (1993). A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41: 338–350
Papadimitriou C.H. and Yannakakis M. (1991). Optimization. approximation and complexity classes. J. Comput. Syst. Sci. 43: 425–440
Raz, R.: A parallel repetition theorem. SIAM J. Comput. 27, 763–803 (electronic) (1998)
Rodoplu V. and Meng T.H. (1999). Minimum energy mobile wireless networks. IEEE J. Select. Areas Commun. 17: 1333–1344
Wattenhofer, R., Li, L., Bahl, V., Wang, Y.: Distributed topology control for power efficient operation in multihop wireless ad hoc networks. In: Proceedings of Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), IEEE Press, pp. 1388–1397 (2001)
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper was done when V. S. Mirrokni was at Computer Science and Artificial Intelligence Laboratory, MIT.
Rights and permissions
About this article
Cite this article
Hajiaghayi, M.T., Kortsarz, G., Mirrokni, V.S. et al. Power optimization for connectivity problems. Math. Program. 110, 195–208 (2007). https://doi.org/10.1007/s10107-006-0057-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-006-0057-5