{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:12:50Z","timestamp":1771035170405,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,17]],"date-time":"2013-06-17T00:00:00Z","timestamp":1371427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,17]]},"DOI":"10.1145\/2462356.2462393","type":"proceedings-article","created":{"date-parts":[[2014,1,7]],"date-time":"2014-01-07T17:18:46Z","timestamp":1389115126000},"page":"145-154","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Kinetic 2-centers in the black-box model"],"prefix":"10.1145","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[{"name":"TU Eindhoven, Eindhoven, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Roeloffzen","sequence":"additional","affiliation":[{"name":"TU Eindhoven, Eindhoven, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[{"name":"TU Eindhoven, Eindhoven, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0110-y"},{"key":"e_1_3_2_1_2_1","unstructured":"epsilon approximation for static 1-center 2-center and k-center but running time is exponentially dependent on epsilon for 2- and k-center.  epsilon approximation for static 1-center 2-center and k-center but running time is exponentially dependent on epsilon for 2- and k-center."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509947"},{"key":"e_1_3_2_1_4_1","first-page":"747","volume-title":"Proc. 8th ACM-SIAM Symp. on Disc. Algorithms","author":"Basch J.","year":"1997","unstructured":"J. Basch , L.J. Guibas and J. Hershberger . Data structures for mobile data . In Proc. 8th ACM-SIAM Symp. on Disc. Algorithms , pages 747 -- 756 , 1997 . k-center with a fixed set of centers and moving points.% J. Basch, L.J. Guibas and J. Hershberger. Data structures for mobile data. In Proc. 8th ACM-SIAM Symp. on Disc. Algorithms, pages 747--756, 1997. k-center with a fixed set of centers and moving points.%"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.07.048"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998196.1998233"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_34"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(99)00019-X"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9250-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(198704)34:2<229::AID-NAV3220340207>3.0.CO;2-1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021819590800257X"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.10.006"},{"key":"e_1_3_2_1_13_1","first-page":"131","volume-title":"Proc. 8th ACM-SIAM Symposium on Discrete Algorithms","author":"Eppstein D.","year":"1997","unstructured":"% D. Eppstein . Faster construction of planar two-centers . In Proc. 8th ACM-SIAM Symposium on Discrete Algorithms , pages Pages 131 -- 138 , 1997 . introduction of k-spread % D. Eppstein. Faster construction of planar two-centers. In Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, pages Pages 131--138, 1997. introduction of k-spread"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-004-1089-3"},{"key":"e_1_3_2_1_15_1","unstructured":"epsilon approximation for the kinetic k-center problem with outliers in the KDS framework.  epsilon approximation for the kinetic k-center problem with outliers in the KDS framework."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2010.01.001"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997848"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-004-2822-7"},{"key":"e_1_3_2_1_19_1","first-page":"72","volume-title":"Proc. 11th Canadian Conf. on Comp. Geometry","author":"Hoffmann M.","year":"1999","unstructured":"M. Hoffmann . A simple linear algorithm for computing rectangular three-centers . In Proc. 11th Canadian Conf. on Comp. Geometry , pages 72 -- 75 , 1999 . NP-completeness of k-center M. Hoffmann. A simple linear algorithm for computing rectangular three-centers. In Proc. 11th Canadian Conf. on Comp. Geometry, pages 72--75, 1999. NP-completeness of k-center"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213014"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/258726.258828"},{"key":"e_1_3_2_1_22_1","first-page":"430","volume-title":"1997 Int. Symp. on Symbolic and Algebraic Computation","author":"Segal M.","year":"1997","unstructured":"M. Segal . On piercing of axis-parallel rectangles and rings. In phProc . 1997 Int. Symp. on Symbolic and Algebraic Computation , pages 430 -- 442 , 1997 .%lower bound of \u03a9(n log n) on euclidean 2-center. M. Segal. On piercing of axis-parallel rectangles and rings. In phProc. 1997 Int. Symp. on Symbolic and Algebraic Computation, pages 430--442, 1997.%lower bound of \u03a9(n log n) on euclidean 2-center."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015670603203"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009311"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/237218.237255"},{"key":"e_1_3_2_1_26_1","first-page":"79","article-title":"A question in the geometry of situation","volume":"1","author":"Sylvester J.J.","year":"1857","unstructured":"J.J. Sylvester . A question in the geometry of situation . Quarterly J. of Mathematics 1 : 79 , 1857 . extensive survey on clustering problems. J.J. Sylvester. A question in the geometry of situation. Quarterly J. of Mathematics 1:79, 1857. extensive survey on clustering problems.","journal-title":"Quarterly J. of Mathematics"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.845141"}],"event":{"name":"SoCG '13: Symposium on Computational Geometry 2013","location":"Rio de Janeiro Brazil","acronym":"SoCG '13","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the twenty-ninth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2462356.2462393","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2462356.2462393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:29Z","timestamp":1750234709000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2462356.2462393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,17]]},"references-count":27,"alternative-id":["10.1145\/2462356.2462393","10.1145\/2462356"],"URL":"https:\/\/doi.org\/10.1145\/2462356.2462393","relation":{},"subject":[],"published":{"date-parts":[[2013,6,17]]},"assertion":[{"value":"2013-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}