| Autor: |
Ballinger, Brad, Benbernou, Nadia, Bose, Prosenjit, Damian, Mirela, Demaine, Erik D., Dujmović, Vida, Flatland, Robin, Hurtado, Ferran, Iacono, John, Lubiw, Anna, Morin, Pat, Sacristán, Vera, Souvaine, Diane, Uehara, Ryuhei |
| Zdroj: |
Combinatorial Optimization & Applications: 4th International Conference, Cocoa 2010, Kailua-kona, Hi, Usa, December 18-20, 2010, Proceedings, Part II; 2010, p1-15, 15p |
| Abstrakt: |
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. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
