{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:20:40Z","timestamp":1759666840921},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,12,11]],"date-time":"2014-12-11T00:00:00Z","timestamp":1418256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s00453-014-9963-8","type":"journal-article","created":{"date-parts":[[2014,12,10]],"date-time":"2014-12-10T16:04:12Z","timestamp":1418227452000},"page":"559-573","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Focus of Attention Problem"],"prefix":"10.1007","volume":"74","author":[{"given":"Dries","family":"Goossens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Polyakovskiy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,11]]},"reference":[{"key":"9963_CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s11590-007-0046-5","volume":"2","author":"M Al-Hasan","year":"2008","unstructured":"Al-Hasan, M., Ramachandran, K.K., Mitchell, J.E.: Optimal placement of stereo sensors. Optim. Lett. 2, 99\u2013111 (2008)","journal-title":"Optim. Lett."},{"key":"9963_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment Problems","author":"RE Burkard","year":"2009","unstructured":"Burkard, R.E., Dell\u2019Amico, M., Martello, S.: Assignment Problems. SIAM, Philadelphia (2009)"},{"key":"9963_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0166-218X(95)00031-L","volume":"65","author":"RE Burkard","year":"1996","unstructured":"Burkard, R.E., Rudolf, R., Woeginger, G.J.: Three-dimensional axial assignment problems with decomposable cost coefficients. Discret. Appl. Math. 65, 123\u2013139 (1996)","journal-title":"Discret. Appl. Math."},{"key":"9963_CR4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0377-2217(92)90078-N","volume":"60","author":"Y Crama","year":"1992","unstructured":"Crama, Y., Spieksma, F.C.R.: Approximation algorithms for three-dimensional assignment problems with triangle inequalities. Eur. J. Oper. Res. 60, 273\u2013279 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"9963_CR5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/MC.2004.93","volume":"37","author":"D Culler","year":"2004","unstructured":"Culler, D., Estrin, D., Srivastava, M.: Guest editors\u2019 introduction: overview of sensor networks. IEEE Comput. 37, 41\u201349 (2004)","journal-title":"IEEE Comput."},{"key":"9963_CR6","doi-asserted-by":"crossref","unstructured":"Gfeller, B., Mihalak, M., Suri, S., Vicari, E., Widmayer, P.: Angle optimization in target tracking. In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT\u20192008), Springer LNCS, vol. 5124, pp. 65\u201376 (2008)","DOI":"10.1007\/978-3-540-69903-3_8"},{"key":"9963_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"9963_CR8","volume-title":"Inequalities","author":"GH Hardy","year":"1934","unstructured":"Hardy, G.H., Littlewood, J.E., P\u00f3lya, G.: Inequalities. Cambridge University Press, Cambridge (1934)"},{"key":"9963_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.cviu.2004.10.008","volume":"100","author":"V Isler","year":"2005","unstructured":"Isler, V., Khanna, S., Spletzer, J.R., Taylor, C.J.: Target tracking with distributed sensors: the focus of attention problem. Comput. Vis. Image Underst. 100, 225\u2013247 (2005)","journal-title":"Comput. Vis. Image Underst."},{"key":"9963_CR10","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0166-218X(96)00128-X","volume":"76","author":"M Queyranne","year":"1997","unstructured":"Queyranne, M., Spieksma, F.C.R.: Approximation algorithms for multi-index transportation problems with decomposable costs. Discret. Appl. Math. 76, 239\u2013253 (1997)","journal-title":"Discret. Appl. Math."},{"key":"9963_CR11","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/0377-2217(95)00003-8","volume":"91","author":"FCR Spieksma","year":"1996","unstructured":"Spieksma, F.C.R., Woeginger, G.J.: Geometric three-dimensional assignment problems. Eur. J. Oper. Res. 91, 611\u2013618 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9963_CR12","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/MP.2003.1197877","volume":"22","author":"M Tubaishat","year":"2003","unstructured":"Tubaishat, M., Madria, S.: Sensor networks: an overview. IEEE Potentials 22, 20\u201323 (2003)","journal-title":"IEEE Potentials"},{"key":"9963_CR13","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger, G.J.: When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS J. Comput. 12, 57\u201374 (2000)","journal-title":"INFORMS J. Comput."},{"key":"9963_CR14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1023\/B:JOSH.0000036858.59787.c2","volume":"7","author":"W Yu","year":"2004","unstructured":"Yu, W., Hoogeveen, H., Lenstra, J.K.: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. J. Sched. 7, 333\u2013348 (2004)","journal-title":"J. Sched."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9963-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9963-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9963-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:47:20Z","timestamp":1559087240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9963-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,11]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["9963"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9963-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,11]]}}}