### 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 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Pages | 356-367 |

Number of pages | 12 |

Volume | 5193 LNCS |

DOIs | |

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) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 16th Annual European Symposium on Algorithms, ESA 2008 |
---|---|

Country | Germany |

City | Karlsruhe |

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

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*(Vol. 5193 LNCS, 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

**Improved approximation algorithms for relay placement.** / Efrat, Alon; Fekete, Sándor P.; Gaddehosur, Poornananda R.; Mitchell, Joseph S B; Polishchuk, Valentin; Suomela, Jukka.

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

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).*vol. 5193 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5193 LNCS, 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

}

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

SN - 3540877436

SN - 9783540877431

VL - 5193 LNCS

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

SP - 356

EP - 367

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

ER -