Improved approximation algorithms for relay placement

Alon Efrat; Sándor P. Fekete; Poornananda R. Gaddehosur; Joseph S.B. Mitchell; Valentin Polishchuk; Jukka Suomela

doi:10.1007/978-3-540-87744-8_30

Improved approximation algorithms for relay placement

Alon Efrat, Sándor P. Fekete, Poornananda R. Gaddehosur, Joseph S.B. Mitchell, Valentin Polishchuk, Jukka Suomela

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

42 Scopus citations

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.

Original language	English (US)
Title of host publication	Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings
Publisher	Springer-Verlag
Pages	356-367
Number of pages	12
ISBN (Print)	3540877436, 9783540877431
DOIs	https://doi.org/10.1007/978-3-540-87744-8_30
State	Published - 2008
Event	16th Annual European Symposium on Algorithms, ESA 2008 - Karlsruhe, Germany Duration: Sep 15 2008 → Sep 17 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5193 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	16th Annual European Symposium on Algorithms, ESA 2008
Country/Territory	Germany
City	Karlsruhe
Period	9/15/08 → 9/17/08

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

Efrat, A., Fekete, S. P., Gaddehosur, P. R., Mitchell, J. S. B., Polishchuk, V., & Suomela, J. (2008). Improved approximation algorithms for relay placement. In Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings (pp. 356-367). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5193 LNCS). Springer-Verlag. https://doi.org/10.1007/978-3-540-87744-8_30

Improved approximation algorithms for relay placement. / Efrat, Alon; Fekete, Sándor P.; Gaddehosur, Poornananda R. et al.
Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings. Springer-Verlag, 2008. p. 356-367 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5193 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Efrat, A, Fekete, SP, Gaddehosur, PR, Mitchell, JSB, Polishchuk, V & Suomela, J 2008, Improved approximation algorithms for relay placement. in Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5193 LNCS, Springer-Verlag, pp. 356-367, 16th Annual European Symposium on Algorithms, ESA 2008, Karlsruhe, Germany, 9/15/08. https://doi.org/10.1007/978-3-540-87744-8_30

Efrat A, Fekete SP, Gaddehosur PR, Mitchell JSB, Polishchuk V, Suomela J. Improved approximation algorithms for relay placement. In Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings. Springer-Verlag. 2008. p. 356-367. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-87744-8_30

@inproceedings{7f275d85249f45caa418940158616998,

title = "Improved approximation algorithms for relay placement",

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.",

author = "Alon Efrat and Fekete, {S{\'a}ndor P.} and Gaddehosur, {Poornananda R.} and Mitchell, {Joseph S.B.} and Valentin Polishchuk and Jukka Suomela",

year = "2008",

doi = "10.1007/978-3-540-87744-8_30",

language = "English (US)",

isbn = "3540877436",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "356--367",

booktitle = "Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings",

note = "16th Annual European Symposium on Algorithms, ESA 2008 ; Conference date: 15-09-2008 Through 17-09-2008",

}

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 -

Improved approximation algorithms for relay placement

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this