@inbook{e1bbdc63d4744a3d942059a5c63f906f,
title = "Power Assignment in Radio Networks with Two Power Levels",
abstract = "We study the power assignment problem in radio networks, where each radio station can transmit in one of two possible power levels, corresponding to two ranges - short and long. We show that this problem is NP-hard, and present a polynomial-time assignment algorithm, such that the number of transmitters that are assigned long range by the algorithm is at most (11/6) times the number of transmitters that are assigned long range by an optimal algorithm.",
author = "Paz Carmi and Katz, {Matthew J.}",
year = "2004",
month = jan,
day = "1",
doi = "10.1007/978-3-540-27810-8_37",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "431--441",
editor = "Torben Hagerup and Jyrki Katajainen",
booktitle = "Algorithm Theory - SWAT 2004",
address = "Germany",
note = "9th Scandinavian Workshop on Algorithm Theory, SWAT 2004 ; Conference date: 08-07-2004 Through 10-07-2004",
}