dc.contributor.author | Ballinger, Brad | |
dc.contributor.author | Benbernou, Nadia M. | |
dc.contributor.author | Bose, Prosenjit | |
dc.contributor.author | Damian, Mirela | |
dc.contributor.author | Demaine, Erik D. | |
dc.contributor.author | Dujmovic, Vida | |
dc.contributor.author | Flatland, Robin | |
dc.contributor.author | Hurtado, Ferran | |
dc.contributor.author | Iacono, John | |
dc.contributor.author | Lubiw, Anna | |
dc.contributor.author | Morin, Pat | |
dc.contributor.author | Sacristan, Vera | |
dc.contributor.author | Souvaine, Diane | |
dc.contributor.author | Uehara, Ryuhei | |
dc.date.accessioned | 2011-05-10T17:39:35Z | |
dc.date.available | 2011-05-10T17:39:35Z | |
dc.date.issued | 2010-12 | |
dc.identifier.isbn | 978-3-642-17460-5 | |
dc.identifier.isbn | 3-642-17460-4 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/62801 | |
dc.description.abstract | For a fixed integer k [greater than or equal to] 0, a k-transmitter is an omnidirectional wireless transmitter with an in nite 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. | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (NSF grant CCF-0728909) | en_US |
dc.language.iso | en_US | |
dc.publisher | Association for Computing Machinery | en_US |
dc.relation.isversionof | http://portal.acm.org/citation.cfm?id=1940425 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.title | Coverage with k-Transmitters in the Presence of Obstacles | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Ballinger, Brad, et al. "Coverage with k-Transmitters in the Presence of Obstacles." COCOA'10, in Proceedings of the 4th International Conference on Combinatorial Optimization and Applications - Volume Part II, Kailua-Kona, Hawaii, USA, Dec. 18-20, 2010. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
dc.contributor.approver | Demaine, Erik D. | |
dc.contributor.mitauthor | Demaine, Erik D. | |
dc.contributor.mitauthor | Benbernou, Nadia M. | |
dc.relation.journal | Proceedings of the 4th International Conference on Combinatorial optimization and applications - Volume Part II, COCOA'10 | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
dspace.orderedauthors | Ballinger, Brad; Benbernou, Nadia; Bose, Prosenjit; Damian, Mirela; Demaine, Erik D.; Dujmovic, Vida; Flatland, Robin; Hurtado, Ferran; Iacono, John; Lubiw, Anna; Morin, Pat; Sacristan, Vera; Souvaine, Diane; Uehara, Ryuhei | |
dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |