{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:46:23Z","timestamp":1742395583696},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,3,31]],"date-time":"2006-03-31T00:00:00Z","timestamp":1143763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s11036-006-4470-z","type":"journal-article","created":{"date-parts":[[2006,4,1]],"date-time":"2006-04-01T07:05:17Z","timestamp":1143875117000},"page":"177-186","source":"Crossref","is-referenced-by-count":9,"title":["Competitive Algorithms for Maintaining a Mobile Center"],"prefix":"10.1007","volume":"11","author":[{"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binay","family":"Bhattacharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Kirkpatrick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Segal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,3,31]]},"reference":[{"key":"4470_CR1","doi-asserted-by":"crossref","unstructured":"P.K. Agarwal, J. Gao and L.J. Guibas, Kinetic medians and kd-trees, in: Proc. 10th Annual European Symposium on Algorithms, LNCS 2461 (2002) pp. 5\u201316.","DOI":"10.1007\/3-540-45749-6_5"},{"issue":"3","key":"4470_CR2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00454-001-0019-x","volume":"26","author":"P. Agarwal","year":"2001","unstructured":"P. Agarwal, L. Guibas, J. Hershberger and E. Veach, Maintaining the extent of a moving point set, Discrete and Computational Geometry 26(3) (2001) 353\u2013374.","journal-title":"Discrete and Computational Geometry"},{"key":"4470_CR3","unstructured":"P.K. Agarwal and S. Har-Peled, Maintaining the approximate extent measures of moving points, in: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms (2001) pp. 148\u2013157."},{"key":"4470_CR4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF01182774","volume":"11","author":"P. Agarwal","year":"1994","unstructured":"P. Agarwal and M. Sharir, Planar geometric location problems, Algorithmica 11 (1994) 185\u2013195.","journal-title":"Algorithmica"},{"key":"4470_CR5","unstructured":"S. Arora, P. Raghavan and S. Rao, Polynomial time approximation schemes for Euclidean k-medians and related problems, in: Proc. 31st ACM Symp. on Theory of Comput. (1998) pp. 106\u2013113."},{"key":"4470_CR6","unstructured":"C. Bajaj, Geometric optimization and computational complexity, Ph.D. thesis. Tech. Report TR-84-629. Cornell University (1984)."},{"key":"4470_CR7","doi-asserted-by":"crossref","unstructured":"J. Basch, Kinetic data structures, Ph.D. thesis, Stanford University, USA (1999).","DOI":"10.1145\/304893.305004"},{"issue":"1","key":"4470_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1998.0988","volume":"31","author":"J. Basch","year":"1999","unstructured":"J. Basch, L. Guibas and J. Hershberger, Data structures for mobile data, Journal of Algorithms 31(1) (1999) 1\u201328.","journal-title":"Journal of Algorithms"},{"key":"4470_CR9","unstructured":"S. Bespamyatnikh, B. Bhattacharya, D. Kirkpatrick and M. Segal, Mobile facility location, in: Proc. of 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, DIAL M (2000) pp. 46\u201353."},{"key":"4470_CR10","doi-asserted-by":"crossref","unstructured":"S. Bespamyatnikh, K. Kedem and M. Segal, Optimal facility location under various distance functions, in Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 1663 (Springer-Verlag, 1999) pp. 318\u2013329.","DOI":"10.1007\/3-540-48447-7_32"},{"key":"4470_CR11","doi-asserted-by":"crossref","unstructured":"S. Bespamyatnikh and M. Segal, Rectilinear static and dynamic center problems, Workshop on Algorithms and Data Structures Lecture Notes in Computer Science 1663 (Springer-Verlag, 1999) pp. 276\u2013287.","DOI":"10.1007\/3-540-48447-7_28"},{"key":"4470_CR12","first-page":"11","volume":"2","author":"J. Brimberg","year":"1994","unstructured":"J. Brimberg and A. Mehrez, Multi-facility location using a maximin criterion and rectangular distances, Location Science 2 (1994) 11\u201319.","journal-title":"Location Science"},{"key":"4470_CR13","doi-asserted-by":"crossref","unstructured":"M. Charikar and S. Guha, Improved combinatorial algorithms for the facility location and k-median problems, in: Proc. 40th Symp. on Found. of Comput. Science (1999) pp. 378\u2013388.","DOI":"10.1109\/SFFCS.1999.814609"},{"key":"4470_CR14","unstructured":"M. Charikar, S. Guha, E. Tardos and D. Shmoys, A constant-factor approximation algorithm for the k-median problem, in: Proc. 32th ACM Symp. on Theory of Comput. (1999) pp. 106\u2013113."},{"key":"4470_CR15","first-page":"741","volume":"35","author":"Z. Drezner","year":"1984","unstructured":"Z. Drezner, The p-center problem: Heuristic and optimal algorithms, Journal of Operational Research Society 35 (1984) 741\u2013748.","journal-title":"Journal of Operational Research Society"},{"key":"4470_CR16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/1520-6750(198704)34:2<229::AID-NAV3220340207>3.0.CO;2-1","volume":"34","author":"Z. Drezner","year":"1987","unstructured":"Z. Drezner, On the rectangular p-center problem, Naval Res. Logist. Q. 34 (1987) 229\u2013234.","journal-title":"Naval Res. Logist. Q."},{"key":"4470_CR17","unstructured":"S. Durocher and D. Kirkpatrick, The Gaussian center of a set of points with applications to mobile facility location, submitted for publication. (See Proc. 15th Canadian Conference on Computational Geometry, 2003, for a preliminary version.)"},{"key":"4470_CR18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","volume":"3","author":"M. Dyer","year":"1985","unstructured":"M. Dyer and M. Frieze, A simple heuristic for the p-center problem, Oper. Res. Lett. 3 (1985) 285\u2013288.","journal-title":"Oper. Res. Lett."},{"key":"4470_CR19","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1287\/ijoc.4.4.418","volume":"4","author":"H. Elgindy","year":"1982","unstructured":"H. Elgindy and M. Keil, Efficient algorithms for the capacitated 1-median problem, ORSA J. Comput. 4 (1982) 418\u2013424.","journal-title":"ORSA J. Comput"},{"key":"4470_CR20","unstructured":"D. Eppstein, Faster construction of planar two-centers, in: Proc. 8th ACM-SIAM Symp. on Discrete Algorithms (1997) pp. 131\u2013138."},{"key":"4470_CR21","doi-asserted-by":"crossref","unstructured":"J. Gao, L. Guibas and A. Nguen, Deformable spanners and applications, ACM Sympos. Comp. Geom. (2004) 190\u2013199.","DOI":"10.1145\/997817.997848"},{"key":"4470_CR22","unstructured":"L. Guibas, Kinetic data structures: A state of the art report, in: Proc. 1998 Workshop Algorithmic Found. Robot. (1998) pp. 191\u2013209."},{"key":"4470_CR23","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s00454-003-2925-6","volume":"30","author":"J. Gao","year":"2003","unstructured":"J. Gao, L. J. Guibas, J. Hershberger, L. Zhang and A. Zhu, Discrete mobile centers, Discrete Comput. Geom. 30 (2003) 45\u201363.","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"4470_CR24","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1002\/(SICI)1097-0037(199912)34:4<250::AID-NET3>3.0.CO;2-T","volume":"34","author":"S. L. Hakimi","year":"1999","unstructured":"S.L. Hakimi, M. Labbe and E. Schmeichel, Locations on time-varying networks, Networks 34(4) (1999) 250\u2013257.","journal-title":"Networks"},{"issue":"4","key":"4470_CR25","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s00454-004-2822-7","volume":"31","author":"S. Har-Peled","year":"2004","unstructured":"S. Har-Peled, Clustering motion, Discrete Comput. Geom. 31(4) (2004) 545\u2013565.","journal-title":"Discrete Comput. Geom."},{"key":"4470_CR26","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D. Hochbaum","year":"1985","unstructured":"D. Hochbaum and D. Shmoys, A best possible approximation algorithm for the k-center probem, Math. Oper. Res. 10 (1985) 180\u2013184.","journal-title":"Math. Oper. Res."},{"key":"4470_CR27","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0966-8349(98)00048-5","volume":"6","author":"D. Hochbaum","year":"1998","unstructured":"D. Hochbaum and A. Pathria, Locating centers in a dynamically changing network and related problems, Location Science 6 (1998) 243\u2013256.","journal-title":"Location Science"},{"key":"4470_CR28","doi-asserted-by":"crossref","unstructured":"K. Jain and V. Vazirani, Primal-dual approximation algorithms for metric facility location and k-median problems, in: Proc. 40th Symp. on Found. of Comput. Science (1999) pp. 2\u201313.","DOI":"10.1109\/SFFCS.1999.814571"},{"key":"4470_CR29","unstructured":"J. Jaromczyk and M. Kowaluk, An efficient algorithm for the Euclidian two-center problem, in: Proc. 10th ACM Sympos. Comput. Geom. (1994) pp. 303\u2013311."},{"key":"4470_CR30","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/BF01584648","volume":"4","author":"H. Kuhn","year":"1973","unstructured":"H. Kuhn, A note on Fermat\u2019s problem, Mathematical Programming 4 (1973) 98\u2013107.","journal-title":"Mathematical Programming"},{"key":"4470_CR31","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0020-0190(92)90208-D","volume":"44","author":"J. Lin","year":"1992","unstructured":"J. Lin and J. Vitter, Approximation algorithm for geometric median problems, Inform. Proc. Lett. 44 (1992) 245\u2013249.","journal-title":"Inform. Proc. Lett."},{"key":"4470_CR32","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, Linear time algorithms for linear programming in R3 and related problems, SIAM J. Comput. 12 (1983) 759\u2013776.","journal-title":"SIAM J. Comput."},{"key":"4470_CR33","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M. Manasse","year":"1990","unstructured":"M. Manasse, L. McGeoch and D. Sleator, Competitive algorithms for server problems, Journal of Algorithms 11 (1990) 208\u2013230.","journal-title":"Journal of Algorithms"},{"issue":"4","key":"4470_CR34","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/0212051","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo and A. Tamir, New results on the complexity of p-center problems, SIAM J. Comput. 12(4) (1983) 751\u2013758.","journal-title":"SIAM J. Comput."},{"issue":"2","key":"4470_CR35","first-page":"202","volume":"28","author":"D. Sleator","year":"1985","unstructured":"D. Sleator and R. Tarjan, Amortized efficiency of list update and paging rules, Communications of the A.C.M. 28(2) (1985) 202\u2013208.","journal-title":"Communications of the A.C.M."}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-006-4470-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-006-4470-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-006-4470-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T22:30:36Z","timestamp":1683412236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-006-4470-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,31]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["4470"],"URL":"https:\/\/doi.org\/10.1007\/s11036-006-4470-z","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"value":"1383-469X","type":"print"},{"value":"1572-8153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3,31]]}}}