TY - GEN

T1 - Improved approximation algorithms for relay placement

AU - Efrat, Alon

AU - Fekete, Sándor P.

AU - Gaddehosur, Poornananda R.

AU - Mitchell, Joseph S.B.

AU - Polishchuk, Valentin

AU - Suomela, Jukka

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=57749178117&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57749178117&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-87744-8_30

DO - 10.1007/978-3-540-87744-8_30

M3 - Conference contribution

AN - SCOPUS:57749178117

SN - 3540877436

SN - 9783540877431

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

SP - 356

EP - 367

BT - Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings

PB - Springer-Verlag

T2 - 16th Annual European Symposium on Algorithms, ESA 2008

Y2 - 15 September 2008 through 17 September 2008

ER -