Highly Influenced

# The Minimum Range Assignment Problem on Linear Radio Networks

@inproceedings{Clementi2000TheMR, title={The Minimum Range Assignment Problem on Linear Radio Networks}, author={Andrea E. F. Clementi and Afonso Ferreira and Paolo Penna and St{\'e}phane P{\'e}rennes and Riccardo Silvestri}, booktitle={ESA}, year={2000} }

- Published in ESA 2000
DOI:10.1007/3-540-45253-2_14

Given a setS of radio stations located on a line and an integer h 1, the MIN ASSIGNMENTproblem consists in finding a range assignment of minimum power consu mption provided that any pair of stations can communicate in at most h hops. Previous positive results for this problem are only kn ow whenh = jSj 1 or in the uniform chain case (i.e. when the stations are equal ly spaced). As for the first case, Kirousis, Kranakis, Krizanc and Pelc (1997) provided a polynomial-ti me algorithm while, for… CONTINUE READING

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 101 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**101**citations based on the available data.See our **FAQ** for additional information.