Adelaide Research & Scholarship
Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/88301
| Citations | ||
| Scopus | Web of Science® | Altmetric |
|---|---|---|
|
?
|
?
|
|
| Type: | Conference paper |
| Title: | The focus of attention problem |
| Author: | Goossens, D. Polyakovskiy, S. Spieksma, F. Woeginger, G. |
| Citation: | Proceedings of the Twenty-First Annual Acm-Siam Symposium on Discrete Algorithms, 2010 / Charikar, M. (ed./s), vol.135, pp.312-317 |
| Publisher: | Association for Computing Machinery |
| Issue Date: | 2010 |
| Series/Report no.: | Proceedings in Applied Mathematics |
| ISBN: | 978-0-898717-01-3 |
| Conference Name: | 21st Annual ACM-SIAM Symposium on Discrete Algorithms (17 Jan 2010 - 19 Jan 2010 : Austin, TX) |
| Editor: | Charikar, M. |
| Statement of Responsibility: | Dries Goossens, Sergey Polyakovskiy, Frits C.R. Spieksma, Gerhard J. Woeginger |
| Abstract: | We 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. |
| Rights: | Copyright © by SIAM. |
| DOI: | 10.1137/1.9781611973075.26 |
| Published version: | http://dl.acm.org/citation.cfm?id=1873627 |
| Appears in Collections: | Aurora harvest 7 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.