{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T19:29:58Z","timestamp":1761766198049,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T00:00:00Z","timestamp":1497312000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001835","name":"Maastricht University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001835","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s11590-017-1159-0","type":"journal-article","created":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T06:56:48Z","timestamp":1497337008000},"page":"1797-1805","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Location, pricing and the problem of Apollonius"],"prefix":"10.1007","volume":"11","author":[{"given":"Andr\u00e9","family":"Berger","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8391-235X","authenticated-orcid":false,"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":[[2017,6,13]]},"reference":[{"issue":"1","key":"1159_CR1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10107-003-0438-y","volume":"97","author":"S Arora","year":"2003","unstructured":"Arora, S.: Approximation schemes for NP-hard geometric optimization problems: a survey. Math. Progr. 97(1), 43\u201369 (2003)","journal-title":"Math. Progr."},{"key":"1159_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Raghavan, P., Rao, S.: Approximation schemes for the Euclidean \n                        $$k$$\n                        \n                            \n                                            \n                                k\n                            \n                        \n                    -medians and related problems, In: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, STOC 1998, Dallas, Texas, USA, ACM, pp. 106\u2013113 (1998)","DOI":"10.1145\/276698.276718"},{"key":"1159_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Feder, T., Motwani, R., Zhu, A.: Algorithms for multi-product pricing, In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, Lecture Notes in Computer Science, vol. 3142, Springer, pp. 72\u201383 (2004)","DOI":"10.1007\/978-3-540-27836-8_9"},{"key":"1159_CR4","doi-asserted-by":"crossref","unstructured":"Balcan, M.-F., Blum, A., Mansour, Y.: Item pricing for revenue maximization, In: Proceedings 9th ACM Conference on Electronic Commerce, EC 2008, Chicago, IL, USA, ACM, pp. 50\u201359 (2008)","DOI":"10.1145\/1386790.1386802"},{"key":"1159_CR5","doi-asserted-by":"crossref","unstructured":"Berger, A., Grigoriev, A., Panin, A., Winokurow, A.: Location, pricing and the problem of Apollonius. In: Discrete Optimization and Operations Research\u20149th International Conference, DOOR 2016, Vladivostok, Russia, Lecture Notes in Computer Science, vol. 9869, Springer, pp. 563\u2013569 (2016)","DOI":"10.1007\/978-3-319-44914-2_44"},{"key":"1159_CR6","doi-asserted-by":"crossref","first-page":"2869","DOI":"10.1007\/978-0-387-74759-0_491","volume-title":"Encyclopedia of Optimization","author":"J Brimberg","year":"2009","unstructured":"Brimberg, J., Wesolowski, G.O.: Optimizing facility location with Euclidean and rectilinear distances. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 2869\u20132873. Springer, Berlin (2009)"},{"key":"1159_CR7","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)"},{"volume-title":"Facility Location: Applications and Theory","year":"2004","key":"1159_CR8","unstructured":"Drezner, Z., Hamacher, H.W. (eds.): Facility Location: Applications and Theory. Springer, Berlin (2004)"},{"key":"1159_CR9","unstructured":"Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing, In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, SIAM, pp. 1164\u20131173 (2005)"},{"issue":"3","key":"1159_CR10","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":"1159_CR11","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":"1159_CR12","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."},{"key":"1159_CR13","unstructured":"Shamos, M.I.: Computational Geometry. PhD Thesis, Yale University (1978)"},{"key":"1159_CR14","unstructured":"WolframMathWorld, Apollonius\u2019 Problem. \n                        http:\/\/mathworld.wolfram.com\/ApolloniusProblem.html\n                        \n                    . Accessed 02 Nov 2016"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1159-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1159-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1159-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,10]],"date-time":"2017-11-10T01:38:24Z","timestamp":1510277904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1159-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,13]]},"references-count":14,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["1159"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1159-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2017,6,13]]}}}