1. Adelaide Research & Scholarship
  2. Schools and Disciplines
  3. School of Computer Science
  4. Computer Science publications
Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/88301
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGoossens, D.-
dc.contributor.authorPolyakovskiy, S.-
dc.contributor.authorSpieksma, F.-
dc.contributor.authorWoeginger, G.-
dc.contributor.editorCharikar, M.-
dc.date.issued2010-
dc.identifier.citationProceedings of the Twenty-First Annual Acm-Siam Symposium on Discrete Algorithms, 2010 / Charikar, M. (ed./s), vol.135, pp.312-317-
dc.identifier.isbn978-0-898717-01-3-
dc.identifier.urihttp://hdl.handle.net/2440/88301-
dc.description.abstractWe consider the problem of assigning sensors to track targets so as to minimize the expected error in the resulting estimation for target locations. The so-called Focus of Attention problem deals with the special case where every target is tracked by one pair of range sensors. We provide a complete complexity and approximability analysis of the Focus Of Attention problem: We establish its strong NP-hardness, and we construct a polynomial time approximation scheme for it.-
dc.description.statementofresponsibilityDries Goossens, Sergey Polyakovskiy, Frits C.R. Spieksma, Gerhard J. Woeginger-
dc.language.isoen-
dc.publisherAssociation for Computing Machinery-
dc.relation.ispartofseriesProceedings in Applied Mathematics-
dc.rightsCopyright © by SIAM.-
dc.source.urihttp://dl.acm.org/citation.cfm?id=1873627-
dc.titleThe focus of attention problem-
dc.typeConference paper-
dc.contributor.conference21st Annual ACM-SIAM Symposium on Discrete Algorithms (17 Jan 2010 - 19 Jan 2010 : Austin, TX)-
dc.identifier.doi10.1137/1.9781611973075.26-
pubs.publication-statusPublished-
dc.identifier.orcidPolyakovskiy, S. [0000-0001-9489-1972]-
Appears in Collections:Aurora harvest 7
Computer Science publications

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.