TY - GEN
T1 - Coverage with k-transmitters in the presence of obstacles
AU - Ballinger, Brad
AU - Benbernou, Nadia
AU - Bose, Prosenjit
AU - Damian, Mirela
AU - Demaine, Erik D.
AU - Dujmović, Vida
AU - Flatland, Robin
AU - Hurtado, Ferran
AU - Iacono, John
AU - Lubiw, Anna
AU - Morin, Pat
AU - Sacristán, Vera
AU - Souvaine, Diane
AU - Uehara, Ryuhei
N1 - Funding Information:
★ Supported by NSF grant CCF-0728909. ★★ Partially supported by projects MTM2009-07242 and Gen. Cat. DGR 2009SGR1040.
PY - 2010
Y1 - 2010
N2 - For a fixed integer k ≥ 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k "walls", represented as line segments in the plane. We develop lower and upper bounds for the number of k-transmitters that are necessary and sufficient to cover a given collection of line segments, polygonal chains and polygons.
AB - For a fixed integer k ≥ 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k "walls", represented as line segments in the plane. We develop lower and upper bounds for the number of k-transmitters that are necessary and sufficient to cover a given collection of line segments, polygonal chains and polygons.
UR - http://www.scopus.com/inward/record.url?scp=78650801307&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78650801307&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-17461-2_1
DO - 10.1007/978-3-642-17461-2_1
M3 - Conference contribution
AN - SCOPUS:78650801307
SN - 3642174604
SN - 9783642174605
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 15
BT - Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Proceedings
T2 - 4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010
Y2 - 18 December 2010 through 20 December 2010
ER -