Abstract
In the relay placement problem the input is a set of sensors and a number r ≥ 1, the communication range of a relay. The objective is to place a minimum number of relays so that between every pair of sensors there is a path through sensors and/or relays such that the consecutive vertices of the path are within distance r if both vertices are relays and within distance 1 otherwise. We present a 3.11-approximation algorithm, and show that the problem admits no PTAS, assuming P ≠ NP. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Efrat, A., Fekete, S. P., Gaddehosur, P. R., Mitchell, J. S. B., Polishchuk, V., & Suomela, J. (2008). Improved approximation algorithms for relay placement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 356–367). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
