{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T09:04:15Z","timestamp":1725872655160},"publisher-location":"Cham","reference-count":4,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319449135"},{"type":"electronic","value":"9783319449142"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44914-2_44","type":"book-chapter","created":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T16:56:02Z","timestamp":1480438562000},"page":"563-569","source":"Crossref","is-referenced-by-count":1,"title":["Location, Pricing and the Problem of Apollonius"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Berger","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Grigoriev","sequence":"additional","affiliation":[]},{"given":"Artem","family":"Panin","sequence":"additional","affiliation":[]},{"given":"Andrej","family":"Winokurow","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,10]]},"reference":[{"key":"44_CR1","unstructured":"D\u00f6rrie, H.: The tangency problem of Apollonius. In: 100 Great Problems of Elementary Mathematics: Their History and Solutions, pp. 154\u2013160. Dover, New York (1965)"},{"issue":"3","key":"44_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0196-6774(87)90012-5","volume":"8","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Maass, W.: Fast approximation algorithms for a nonconvex covering problem. J. Algorithms 8(3), 305\u2013323 (1987)","journal-title":"J. Algorithms"},{"issue":"2","key":"44_CR3","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1137\/0215031","volume":"15","author":"W Maass","year":"1986","unstructured":"Maass, W.: On the complexity of nonconvex covering. SIAM J. Comput. 15(2), 453\u2013467 (1986)","journal-title":"SIAM J. Comput."},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1007\/s00454-010-9285-9","volume":"44","author":"NH Mustafa","year":"2010","unstructured":"Mustafa, N.H., Ray, S.: Improved results on geometric hitting set problems. Discrete Comput. Geom. 44, 883\u2013895 (2010)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Discrete Optimization and Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44914-2_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T00:47:51Z","timestamp":1498351671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44914-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449135","9783319449142"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44914-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}