{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T14:59:44Z","timestamp":1710255584843},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T00:00:00Z","timestamp":1267056000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10878-010-9303-0","type":"journal-article","created":{"date-parts":[[2010,2,24]],"date-time":"2010-02-24T15:50:22Z","timestamp":1267026622000},"page":"32-51","source":"Crossref","is-referenced-by-count":6,"title":["Minimum covering with travel cost"],"prefix":"10.1007","volume":"24","author":[{"given":"S\u00e1ndor P.","family":"Fekete","sequence":"first","affiliation":[]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[]},{"given":"Christiane","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,25]]},"reference":[{"key":"9303_CR1","doi-asserted-by":"crossref","unstructured":"Alt H, Arkin EM, Br\u00f6nnimann H, Erickson J, Fekete SP, Knauer C, Lenchner J, Mitchell JSB, Whittlesey K (2006) Minimum-cost coverage of point sets by disks. In: Proc. 22nd ACM symposium on computational geometry, pp 449\u2013458","DOI":"10.1145\/1137856.1137922"},{"key":"9303_CR2","doi-asserted-by":"crossref","unstructured":"Amit Y, Mitchell JSB, Packer E (2010) Locating guards for visibility coverage of polygons. Int J Comput Geom Appl (to appear)","DOI":"10.1142\/S0218195910003451"},{"issue":"1\u20132","key":"9303_CR3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0925-7721(00)00015-8","volume":"17","author":"EM Arkin","year":"2000","unstructured":"Arkin EM, Fekete SP, Mitchell JSB (2000) Approximation algorithms for lawn mowing and milling. Comput Geom Theory Appl 17(1\u20132):25\u201350","journal-title":"Comput Geom Theory Appl"},{"key":"9303_CR4","doi-asserted-by":"crossref","unstructured":"Baumgartner T, Fekete SP, Kr\u00f6ller A, Schmidt C (2010) Exact solutions and bounds for general art gallery problems. In: Proc. SIAM-ACM workshop on algorithm engineering and experiments (ALENEX\u00a02010)","DOI":"10.1137\/1.9781611972900.2"},{"issue":"3","key":"9303_CR5","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s00453-001-0022-x","volume":"30","author":"C Baur","year":"2001","unstructured":"Baur C, Fekete SP (2001) Approximation of geometric dispersion problems. Algorithmica 30(3):451\u2013470","journal-title":"Algorithmica"},{"key":"9303_CR6","series-title":"LNCS","first-page":"640","volume-title":"International conference on computational science\u00a0(1)","author":"A Bhattacharya","year":"2001","unstructured":"Bhattacharya A, Ghosh SK, Sarkar S (2001) Exploring an unknown polygonal environment with bounded visibility. In: International conference on computational science\u00a0(1). LNCS, vol 2073. Springer, Berlin, pp 640\u2013648"},{"key":"9303_CR7","doi-asserted-by":"crossref","unstructured":"Chin W-P, Ntafos S (1988) Optimum watchman routes. In: Proc 2nd ACM Symposium on Computational Geometry, vol.\u00a028(1), pp 39\u201344","DOI":"10.1016\/0020-0190(88)90141-X"},{"key":"9303_CR8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02574671","volume":"6","author":"W-P Chin","year":"1991","unstructured":"Chin W-P, Ntafos SC (1991) Shortest watchman routes in simple polygons. Discrete Comput Geom 6:9\u201331","journal-title":"Discrete Comput Geom"},{"issue":"1","key":"9303_CR9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0196-6774(03)00047-6","volume":"48","author":"A Dumitrescu","year":"2003","unstructured":"Dumitrescu A, Mitchell JSB (2003) Approximation algorithms for TSP with neighborhoods in the plane. J Algorithms 48(1):135\u2013159","journal-title":"J Algorithms"},{"issue":"6","key":"9303_CR10","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.ipl.2006.05.014","volume":"100","author":"A Efrat","year":"2006","unstructured":"Efrat A, Har-Peled S (2006) Guarding galleries and terrains. Inf Process Lett 100(6):238\u2013245","journal-title":"Inf Process Lett"},{"key":"9303_CR11","unstructured":"Fekete SP, Schmidt C (2008) Polygon exploration with discrete vision. In: CoRR, 0807.2358"},{"key":"9303_CR12","unstructured":"Fekete SP, Schmidt C (2009) Low-cost tours for nearsighted watchmen with discrete vision. In: 25th European workshop on computational geometry, pp 171\u2013174"},{"issue":"2","key":"9303_CR13","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.comgeo.2009.06.003","volume":"43","author":"SP Fekete","year":"2010","unstructured":"Fekete SP, Schmidt C (2010) Polygon exploration with time-discrete vision. Comput Geom Theory Appl 43(2):148\u2013168","journal-title":"Comput Geom Theory Appl"},{"key":"9303_CR14","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/978-3-642-10631-6_41","volume-title":"Proc. 20th international symposium on algorithms and computation","author":"SP Fekete","year":"2009","unstructured":"Fekete SP, Mitchell JSB, Schmidt C (2009) Minimum covering with travel cost. In: Proc. 20th international symposium on algorithms and computation. Lecture notes in computer science, vol 5878. Springer, Berlin, pp 393\u2013402"},{"issue":"1","key":"9303_CR15","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum DS, Maass W (1985) Approximation schemes for covering and packing problems in image processing and vlsi. J ACM 32(1):130\u2013136","journal-title":"J ACM"},{"issue":"4","key":"9303_CR16","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A Itai","year":"1982","unstructured":"Itai A, Papadimitriou CH, Szwarcfiter JL (1982) Hamilton paths in grid graphs. SIAM J Comput 11(4):676\u2013686","journal-title":"SIAM J Comput"},{"key":"9303_CR17","doi-asserted-by":"crossref","first-page":"665","DOI":"10.2307\/2371320","volume":"61","author":"R Kershner","year":"1939","unstructured":"Kershner R (1939) The number of circles covering a set. Am J Math 61:665\u2013667","journal-title":"Am J Math"},{"key":"9303_CR18","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1137\/S0097539796309764","volume":"28","author":"JSB Mitchell","year":"1999","unstructured":"Mitchell JSB (1999) Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J Comput 28:1298\u20131309","journal-title":"SIAM J Comput"},{"key":"9303_CR19","unstructured":"Mitchell JSB (2007) A PTAS for TSP with neighborhoods among fat regions in the plane. In: Proc. 18th annual ACM-SIAM symposium on discrete algorithms, pp 11\u201318"},{"key":"9303_CR20","series-title":"International series of monographs on computer science","volume-title":"Art gallery theorems and algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke J (1987) Art gallery theorems and algorithms. International series of monographs on computer science. Oxford University Press, New York"},{"key":"9303_CR21","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P Rosenstiehl","year":"1986","unstructured":"Rosenstiehl P, Tarjan RE (1986) Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput Geom 1:343\u2013353","journal-title":"Discrete Comput Geom"},{"issue":"1","key":"9303_CR22","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/BF02565608","volume":"23","author":"LF T\u00f3th","year":"1949","unstructured":"T\u00f3th LF (1949) \u00dcber dichteste Kreislagerung und d\u00fcnnste Kreis\u00fcberdeckung. Comment Math Helv 23(1):342\u2013349","journal-title":"Comment Math Helv"},{"issue":"1","key":"9303_CR23","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1177\/02783640022066716","volume":"19","author":"IA Wagner","year":"2000","unstructured":"Wagner IA, Lindenbaum M, Bruckstein AM (2000) MAC vs. PC: Determinism and randomness as complementary approaches to robotic exploration of continuous unknown domains. Int J Robotics Res 19(1):12\u201331","journal-title":"Int J Robotics Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9303-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9303-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9303-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:15Z","timestamp":1559276295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9303-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,25]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9303"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9303-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,25]]}}}