Show simple item record

dc.contributor.authorBallinger, Brad
dc.contributor.authorBenbernou, Nadia M.
dc.contributor.authorBose, Prosenjit
dc.contributor.authorDamian, Mirela
dc.contributor.authorDemaine, Erik D.
dc.contributor.authorDujmovic, Vida
dc.contributor.authorFlatland, Robin
dc.contributor.authorHurtado, Ferran
dc.contributor.authorIacono, John
dc.contributor.authorLubiw, Anna
dc.contributor.authorMorin, Pat
dc.contributor.authorSacristan, Vera
dc.contributor.authorSouvaine, Diane
dc.contributor.authorUehara, Ryuhei
dc.date.accessioned2011-05-10T17:39:35Z
dc.date.available2011-05-10T17:39:35Z
dc.date.issued2010-12
dc.identifier.isbn978-3-642-17460-5
dc.identifier.isbn3-642-17460-4
dc.identifier.urihttp://hdl.handle.net/1721.1/62801
dc.description.abstractFor 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.sponsorshipNational Science Foundation (U.S.) (NSF grant CCF-0728909)en_US
dc.language.isoen_US
dc.publisherAssociation for Computing Machineryen_US
dc.relation.isversionofhttp://portal.acm.org/citation.cfm?id=1940425en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceMIT web domainen_US
dc.titleCoverage with k-Transmitters in the Presence of Obstaclesen_US
dc.typeArticleen_US
dc.identifier.citationBallinger, 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.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematicsen_US
dc.contributor.approverDemaine, Erik D.
dc.contributor.mitauthorDemaine, Erik D.
dc.contributor.mitauthorBenbernou, Nadia M.
dc.relation.journalProceedings of the 4th International Conference on Combinatorial optimization and applications - Volume Part II, COCOA'10en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dspace.orderedauthorsBallinger, 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.orcidhttps://orcid.org/0000-0003-3803-5703
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record