@inbook{f15514094995447383696c3b3ed88c27,
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 = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",
}