{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T08:40:24Z","timestamp":1737621624650,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77120-3_31","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:31:09Z","timestamp":1196940669000},"page":"341-352","source":"Crossref","is-referenced-by-count":1,"title":["Kinetic Maintenance of Mobile k-Centres on Trees"],"prefix":"10.1007","author":[{"given":"Stephane","family":"Durocher","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00454-001-0019-x","volume":"26","author":"P.K. Agarwal","year":"2001","unstructured":"Agarwal, P.K., Guibas, L.J., Hershberger, J., Veach, E.: Maintaining the extent of a moving point set. Disc. & Comp. Geom.\u00a026, 353\u2013374 (2001)","journal-title":"Disc. & Comp. Geom."},{"key":"31_CR2","unstructured":"Agarwal, P.K., Har-Peled, S.: Maintaining approximate extent measures of moving points. In: SODA, pp. 148\u2013157 (2001)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Basch, J.: Kinetic Data Structures. PhD thesis, Stanford U. (1999)","DOI":"10.1145\/304893.305004"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1998.0988","volume":"31","author":"J. Basch","year":"1999","unstructured":"Basch, J., Guibas, L., Hershberger, J.: Data structures for mobile data. J. Alg.\u00a031, 1\u201328 (1999)","journal-title":"J. Alg."},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Basch, J., Guibas, L.J., Silverstein, C., Zhang, L.: A practical evaluation of kinetic data structures. In: SOCG, pp. 388\u2013390 (1997)","DOI":"10.1145\/262839.263016"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Bespamyatnikh, S., Bhattacharya, B., Kirkpatrick, D., Segal, M.: Mobile facility location. In: Int. ACM Work. on Disc. Alg. & Meth. for Mob. Comp. & Comm, pp. 46\u201353 (2000)","DOI":"10.1145\/345848.345858"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1023\/A:1008947018074","volume":"11","author":"G. Bruno","year":"2000","unstructured":"Bruno, G., Ghiani, G., Improta, G.: Dynamic positioning of idle automated guided vehicles. J. Int. Man.\u00a011, 209\u2013215 (2000)","journal-title":"J. Int. Man."},{"key":"31_CR8","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/trsc.8.4.333","volume":"8","author":"P.M. Dearing","year":"1974","unstructured":"Dearing, P.M., Francis, R.L.: A minimax location problem on a network. Trans. Sci.\u00a08, 333\u2013343 (1974)","journal-title":"Trans. Sci."},{"key":"31_CR9","unstructured":"Durocher, S.: Geometric Facility Location under Continuous Motion. PhD thesis, U. of British Columbia (2006)"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1142\/S0218195906002075","volume":"16","author":"S. Durocher","year":"2006","unstructured":"Durocher, S., Kirkpatrick, D.: The Steiner centre: Stability, eccentricity, and applications to mobile facility location. Int. J. Comp. Geom. & App.\u00a016, 345\u2013371 (2006)","journal-title":"Int. J. Comp. Geom. & App."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Durocher, S., Kirkpatrick, D.: Bounded-velocity approximations of mobile Euclidean 2-centres. Int. J. Comp. Geom. & App. (to appear, 2007)","DOI":"10.1142\/S021819590800257X"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.10108","volume":"43","author":"D. Dvir","year":"2004","unstructured":"Dvir, D., Handler, G.Y.: The absolute center of a network. Networks\u00a043, 109\u2013118 (2004)","journal-title":"Networks"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BFb0028271","volume-title":"Algorithms and Data Structures","author":"G.N. Frederickson","year":"1991","unstructured":"Frederickson, G.N.: Parametric search and locating supply centers in trees. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol.\u00a0519, pp. 299\u2013319. Springer, Heidelberg (1991)"},{"key":"31_CR14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s00454-003-2925-6","volume":"30","author":"J. Gao","year":"2003","unstructured":"Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Discrete mobile centers. Disc. & Comp. Geom.\u00a030, 45\u201365 (2003)","journal-title":"Disc. & Comp. Geom."},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.comgeo.2005.10.001","volume":"35","author":"J. Gao","year":"2006","unstructured":"Gao, J., Guibas, L.J., Nguyen, A.: Deformable spanners and applications. Comp. Geom.: Th. & App.\u00a035, 2\u201319 (2006)","journal-title":"Comp. Geom.: Th. & App."},{"key":"31_CR16","unstructured":"Guibas, L.J.: Kinetic data structures: a state of the art report. In: Work. Alg. Found. Rob, pp. 191\u2013209. A. K. Peters, Ltd (1998)"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0377-2217(82)90136-9","volume":"10","author":"J. Halpern","year":"1982","unstructured":"Halpern, J., Maimon, O.: Algorithms for the m-center problems: A survey. Eur. J. Oper. Res.\u00a010, 90\u201399 (1982)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR18","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"G.Y. Handler","year":"1973","unstructured":"Handler, G.Y.: Minimax location of a facility in an undirected tree graph. Trans. Sci.\u00a07, 287\u2013293 (1973)","journal-title":"Trans. Sci."},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/trsc.12.2.93","volume":"12","author":"G.Y. Handler","year":"1978","unstructured":"Handler, G.Y.: Finding two-centers of a tree: The continuous case. Trans. Sci.\u00a012, 93\u2013106 (1978)","journal-title":"Trans. Sci."},{"key":"31_CR20","first-page":"113","volume":"31","author":"P. Hansen","year":"1987","unstructured":"Hansen, P., Labb\u00e9, M., Peeters, D., Thisse, J.F.: Single facility location on networks. An. Disc. Math.\u00a031, 113\u2013146 (1987)","journal-title":"An. Disc. Math."},{"key":"31_CR21","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","volume":"33","author":"J. Hershberger","year":"1989","unstructured":"Hershberger, J.: Finding the upper envelope of n line segments in O(n logn) time. Inf. Proc. Let.\u00a033, 169\u2013174 (1989)","journal-title":"Inf. Proc. Let."},{"key":"31_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.comgeo.2004.02.004","volume":"31","author":"J. Hershberger","year":"2005","unstructured":"Hershberger, J.: Smooth kinetic maintenance of clusters. Comp. Geom.: Th. & App.\u00a031, 3\u201330 (2005)","journal-title":"Comp. Geom.: Th. & App."},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. I: The p-centers. SIAM J. App. Math.\u00a037, 513\u2013538 (1979)","journal-title":"SIAM J. App. Math."},{"key":"31_CR24","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1287\/mnsc.29.4.482","volume":"29","author":"B.C. Tansel","year":"1983","unstructured":"Tansel, B.C., Francis, R.L., Lowe, T.J.: Location on networks: A survey. part I: The p-center and p-median problems. Man. Sci.\u00a029, 482\u2013497 (1983)","journal-title":"Man. Sci."},{"key":"31_CR25","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/mnsc.29.4.498","volume":"29","author":"B.C. Tansel","year":"1983","unstructured":"Tansel, B.C., Francis, R.L., Lowe, T.J.: Location on networks: A survey. part II: Exploiting tree network structure. Man. Sci.\u00a029, 498\u2013511 (1983)","journal-title":"Man. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T08:11:09Z","timestamp":1737619869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771180"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_31","relation":{},"subject":[]}}