{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:56Z","timestamp":1725489176504},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441861"},{"type":"electronic","value":"9783540457534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45753-4_14","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:37:09Z","timestamp":1187249829000},"page":"146-160","source":"Crossref","is-referenced-by-count":4,"title":["Facility Location and the Geometric Minimum-Diameter Spanning Tree"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Gudmundsson","sequence":"first","affiliation":[]},{"given":"Herman","family":"Haverkort","sequence":"additional","affiliation":[]},{"given":"Sang-Min","family":"Park","sequence":"additional","affiliation":[]},{"given":"Chan-Su","family":"Shin","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01293483","volume":"13","author":"P.K. Agarwal","year":"1995","unstructured":"P.K. Agarwal and J. Matou\u0161ek. Dynamic half-space range reporting and its applications.Algorithmica,13:325\u2013345,1995.","journal-title":"Algorithmica"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"P.K. Agarwal, M. Sharir, and E. Welzl. The discrete 2-center problem. Discrete & Computational Geometry, 20,1998.","DOI":"10.1007\/PL00009387"},{"key":"14_CR3","unstructured":"G. Barequet and S. Har-Peled. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions.In Proc.10th Annual ACM-SIAM Symp.on Discr.Algorithms (SODA\u2019 99), pages 82\u201391, Baltimore,1999."},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P.B. Callahan","year":"1995","unstructured":"P.B. Callahan and S.R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM, 42(1):67\u201390, Jan.1995.","journal-title":"Journal of the ACM"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"T.M. Chan. Approximating the diameter,width,smallest enclosing cylinder, and minimum-width annulus. In Proc.16th Annual Symposium on Computational Geometry (SoCG\u2019 00), pages 300\u2013309, New York, 12\u201314 June 2000.ACM Press.","DOI":"10.1145\/336154.336216"},{"key":"14_CR6","unstructured":"T.M. Chan. Semi-online maintenance of geometric optima and measures. In Proc. 13th Symp.on Discr.Algorithms (SODA\u2019 02),pages 474\u2013483,2002."},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle and L.J. Guibas. Fractional cascading: I.A data structuring technique.Algorithmica,1(3):133\u2013162,1986.","journal-title":"Algorithmica"},{"key":"14_CR8","volume-title":"Computers and Intractability:A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson.Computers and Intractability:A Guide to the Theory of NP-Completeness. W.H.Freeman, New York, NY,1979."},{"key":"14_CR9","unstructured":"J. Gudmundsson, H. Haverkort, S.-M. Park, C.-S. Shin, and A. Wolff. Approximating the geometric minimum-diameter spanning tree.Technical Report 4\/2002, Institut f\u00fcr Mathematikund Informatik, Universit\u00e4t Greifswald, Mar. 2002.See http:\/\/www.uni-greifswald.de\/~wwwmathe\/preprints\/shadow\/wolff02_4.rdf.html ."},{"issue":"5","key":"14_CR10","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1137\/0220060","volume":"20","author":"J.-M. Ho","year":"1991","unstructured":"J.-M. Ho, D.T. Lee, C.-H. Chang, and C.K. Wong.Minimum diameter spanning trees and related problems.SIAM Journal on Computing,20(5):987\u2013997,1991.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"M.J. Spriggs, J.M. Keil, S. Bespamyatnikh, M. Segal, and J. Snoeyink.Computing a (1 + \u2208)-approximate geometric minimum-diameter spanning tree.Private communication,2002.","DOI":"10.1007\/s00453-003-1056-z"}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45753-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:33:01Z","timestamp":1556757181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45753-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441861","9783540457534"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45753-4_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}