{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T06:25:51Z","timestamp":1764570351097},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653851"},{"type":"electronic","value":"9783540493815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49381-6_5","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T01:47:50Z","timestamp":1196646470000},"page":"30-40","source":"Crossref","is-referenced-by-count":4,"title":["Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles"],"prefix":"10.1007","author":[{"given":"Joonsoo","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chan-Su","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung Kwon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,29]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0218035","volume":"18","author":"M. J. Atallah","year":"1989","unstructured":"M. J. Atallah, R. Cole, and M. T. Goodrich, Cascading divide-and-conquer: a technique for designing parallel algorithms, SIAM J. Comput., 18:499\u2013532, 1989.","journal-title":"SIAM J. Comput."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(94)90100-7","volume":"49","author":"V. Chepoi","year":"1994","unstructured":"V. Chepoi and F. Dragan, Computing a median point of a simple rectilinear polygon, Inform. Process. Lett., 49:281\u2013285, 1994.","journal-title":"Inform. Process. Lett."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1137\/0215052","volume":"15","author":"M. E. Dyer","year":"1986","unstructured":"M. E. Dyer, On a multidimensional search technique and its application to the Euclidean one-centre problem, SIAM J. Comput., 15:725\u2013738, 1986.","journal-title":"SIAM J. Comput."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02187714","volume":"4","author":"P. J. Rezende de","year":"1989","unstructured":"P. J. deRezende, D. T. Lee, and Y. F. Wu, Rectilinear shortest paths in the presence of rectilinear barriers, Discrete Comput. Geom., 4:41\u201353, 1989.","journal-title":"Discrete Comput. Geom."},{"key":"5_CR5","volume-title":"Facility Layout and Location","author":"R. L. Francis","year":"1974","unstructured":"R. L. Francis and J. A. White, Facility Layout and Location, Prentice Hall, Englewood Cliffs, NJ, 1974."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0255(91)90050-5","volume":"54","author":"M. T. Ko","year":"1991","unstructured":"M. T. Ko and R. C. T. Lee, On weighted rectilinear 2-center and 3-center problems, Inform. Sci., 54:169\u2013190, 1991. 30","journal-title":"Inform. Sci."},{"key":"5_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-63890-3_35","volume-title":"Proc. of ISAAC\u201997","author":"Y. Kusakari","year":"1997","unstructured":"Y. Kusakari and T. Nishizeki, An algorithm for finding a region with the minimum total L\n                           1-distance from prescribed terminals, Proc. of ISAAC\u201997, Lecture Notes in Computer Science, Springer-Verlag, 324\u2013333, 1997."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1287\/opre.31.4.652","volume":"31","author":"R. C. Larson","year":"1983","unstructured":"R. C. Larson and G. Sadiq, Facility locations with the Manhattan metric in the presence of barriers to travel, Oper. Res., 31:652\u2013669, 1983.","journal-title":"Oper. Res."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM, 30:852\u2013865, 1983.","journal-title":"J. ACM"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"M. Sharir and E. Welzl, Rectilinear and polygonal p-piercing and p-center problems, Proc. 12th ACM Symp. Comput. Geom., 122\u2013132, 1996.","DOI":"10.1145\/237218.237255"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49381-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T23:48:53Z","timestamp":1551138533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49381-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653851","9783540493815"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-49381-6_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}