### 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 |

Pages | 356-367 |

Number of pages | 12 |

DOIs | |

State | Published - Dec 24 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 | Germany |

City | Karlsruhe |

Period | 9/15/08 → 9/17/08 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Improved approximation algorithms for relay placement'. Together they form a unique fingerprint.

## 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). https://doi.org/10.1007/978-3-540-87744-8-30