Assign ranges in general ad-hoc networks
Section snippets
Janka Chlebíková received her M.Sc. degree in Mathematics from Charles University (Prague, Czechia) in 1988 and Ph.D. in Computer Science from Comenius University (Bratislava, Slovakia) in 2000. From 2001 to 2004 she had a postdoctoral fellowship at the Institute of Computer Science of CAU University in Kiel, Germany. She is working as an associate professor at the Institute of Informatics of Comenius University. Her research interests include structural graph theory, combinatorial optimization
References (35)
- et al.
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
Inform. Process. Lett.
(2003) - et al.
Mobile ad hoc networking: imperatives and challenges
Ad Hoc Networks
(2003) - et al.
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Theoret. Comput. Sci.
(2003) - et al.
Power consumption in packet radio networks
Theoret. Comput. Sci.
(2000) - C. Ambühl, A.E.F. Clementi, M. Di Ianni, A. Monti, G. Rossi, R. Silvestri, The range assignment problem in...
- C. Ambühl, A.E.F. Clementi, M. Di Ianni, N. Lev-Tov, A. Monti, D. Peleg, G. Rossi, R. Silvestri, Efficient algorithms...
- Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications, in: Proceedings of the 37th...
- Y. Bartal, On approximating arbitrary metrics by tree metrics, in: Proceedings of the 30th Annual ACM Symposium on...
- E.M. Belding-Royer, C.-K. Toh, A review of current routing protocols for ad-hoc mobile wireless networks, IEEE Personal...
- G. Calinescu, S. Kapoor, A. Olshevsky, A. Zelikovsky, Network lifetime and power assignment in ad hoc wireless...
The minimum range assignment problem on linear radio networks
Algorithmica
Cited by (3)
Packing trees in communication networks
2008, Journal of Combinatorial OptimizationApproximation algorithms for general packing problems and their application to the multicast congestion problem
2008, Mathematical ProgrammingRange assignment problem in wireless network
2008, Algorithms, Architectures And Information Systems Security
Janka Chlebíková received her M.Sc. degree in Mathematics from Charles University (Prague, Czechia) in 1988 and Ph.D. in Computer Science from Comenius University (Bratislava, Slovakia) in 2000. From 2001 to 2004 she had a postdoctoral fellowship at the Institute of Computer Science of CAU University in Kiel, Germany. She is working as an associate professor at the Institute of Informatics of Comenius University. Her research interests include structural graph theory, combinatorial optimization and bioinformatics.
Deshi Ye received his B.S. degree and Ph.D. degree in Mathematics from Zhejiang University, China, in 1999 and 2005, respectively. He is currently a research staff in the Department of Computer Science at the University of Hong Kong. His research interests include wireless network and mobile computing.
Hu Zhang is currently a postdoc in the advanced optimization lab at McMaster University. He got his bachelor degree and a master degree in aerodynamics at Nanjing University of Aeronautics and Astronautics, and another master degree in mathematics at Hong Kong University of Science and Technology. He obtained his Ph.D. degree in theoretical computer science at University of Kiel, Germany. He is working on design, analysis and implementation of approximation algorithms for mathematical programming and combinatorial optimization problems, such as scheduling, VLSI design, digital communication.
- 1
This work was done in part when this author was working at the University of Kiel. Research supported in part by EU-Project ARACNE, Research Training Network, Approximation and Randomized Algorithms in Communication Networks, HPRN-CT-1999-00112.
- 2
This work was done in part when this author was studying at the University of Kiel. Research supported in part by a DAAD Sandwich Project and by NSFC(10231060).
- 3
This work was done in part when this author was studying at the University of Kiel. Research supported in part by the DFG Graduiertenkolleg 357, Effiziente Algorithmen und Mehrskalenmethoden by EU Thematic Network APPOL II, Approximation and Online Algorithms for Optimization Problems, IST-2001-32007, by EU Project CRESCCO, Critical Resource Sharing for Cooperation in Complex Systems, IST-2001-33135, by an MITACS grant of Canada, and by the NSERC Discovery Grant DG 5-48923.