Min-power strong connectivity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6302 LNCS, Issue , 2010, Pages 67-80

  Calinescu, Gruia ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149307260     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15369-3_6     Document Type: Conference Paper

References (30)

1. 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)
2. Ambühl, C., Clementi, A.E.F., Penna, P., Rossi, G., Silvestri, R.: On the approximability of the range assignment problem on radio networks in presence of selfish agents. Theor. Comput. Sci. 343(1-2), 27-41 (2005)
3. Byrka, J., Grandoni, F., Rothvoß, T., Sanità, L.: An improved LP-based approximation for Steiner tree. In: STOC 2010: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 583-592. ACM, New York (2010)
4. Caragiannis, I., Flammini, M., Moscardelli, L.: An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 447-458. Springer, Heidelberg (2007)
5. Carmi, P., Katz, M.J.: Power assignment in radio networks with two power levels. Algorithmica 47(2), 183-201 (2007) (Pubitemid 46227254)
6. Chen, W.T., Huang, N.F.: The strongly connecting problem on multihop packet radio networks. IEEE Transactions on Communications 37(3), 293-295 (1989)
7. Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Carnegie Mellon University (1976)
8. Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. In: Electronic Colloquium on Computational Complexity (ECCC) (054) (2000)
9. Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Mathematical Programming 5(1), 88-124 (1973)
10. Gabow, H.N., Stallmann, M.: Efficient algorithms for graphic matroid intersection and parity. In: 12th Colloq. on Automata, Language and Programming, pp. 210-220 (1985)
11. Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Feeman and Co., NY (1979)
12. Graham, R.L., Grötschel, M., Lovász, L. (eds.): Handbook of combinatorics, vol. 1, 2. Elsevier Science B.V., Amsterdam (1995)
13. Gröpl, C., Hougardy, S., Nierhoff, T., Prömel, H.J.: Approximation algorithms for the Steiner tree problem in graphs. In: Du, D.-Z., Cheng, X. (eds.) Steiner Trees in Industries, pp. 235-279. Kluwer Academic Publishers, Dordrecht (2001)
14. Hajiaghayi, M.T., Immorlica, N., Mirrokni, V.S.: Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. In: MOBI-COM, pp. 300-312 (2003)
15. Hajiaghayi, M.T., Kortsarz, G., Mirrokni, V.S., Nutov, Z.: Power optimization for connectivity problems. Math. Program. 110(1), 195-208 (2007)
16. Jothi, R., Raghavachari, B., Varadarajan, S.: A 5/4-approximation algorithm for minimum 2-edge-connectivity. In: SODA 2003: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 725-734. Society for Industrial and Applied Mathematics, Philadelphia (2003)
17. Khuller, S., Raghavachari, B., Young, N.: Approximating the minimum equivalent digraph. SIAM J. Comput. 24(4), 859-872 (1995)
18. Khuller, S., Raghavachari, B., Young, N.: On strongly connected digraphs with bounded cycle length. Discrete Appl. Math. 69(3), 281-289 (1996)
19. Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science 243, 289-305 (2000)
20. Kortsarz, G., Mirrokni, V.S., Nutov, Z., Tsanko, E.: Approximating minimum-power degree and connectivity problems. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 423-435. Springer, Heidelberg (2008) (Pubitemid 351658863)
21. Lovász, L., Plummer, M.D.: Matching Theory. Elsevier, Amsterdam (1986)
22. Nutov, Z., Yaroshevitch, A.: Wireless network design via 3-decompositions. Inf. Process. Lett. 109(19), 1136-1140 (2009)
23. Ramanathan, R., Rosales-Hain, R.: Topology control of multihop wireless networks using transmit power adjustment. In: INFOCOM (2), pp. 404-413 (2000)
24. Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 770-779 (2000)
25. Robins, G., Zelikovsky, A.: Tighter bounds for graph Steiner tree approximation. SIAM Journal of Discrete Mathematics 19(1), 122-134 (2005)
26. Schrijver, A.: Combinatorial Optimization. Springer, Heidelberg (2003)
27. Szigeti, Z.: On the graphic matroid parity problem. J. Combin. Theory Ser. B 88, 247-260 (2003)
28. Vetta, A.: Approximating the minimum strongly connected subgraph via a matching lower bound. In: SODA 2001: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 417-426. Society for Industrial and Applied Mathematics, Philadelphia (2001)
29. Wattenhofer, R., Li, L., Bahl, P., Wang, Y.-M.: Distributed topology control for wireless multihop ad-hoc networks. In: IEEE INFOCOM 2001 (2001)
30. Zelikovsky, A.: Better approximation bounds for the network and Euclidean Steiner tree problems. Technical Report CS-96-06, Department of Computer Science, University of Virginia (1996)