{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:44:51Z","timestamp":1725486291014},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540416951"},{"type":"electronic","value":"9783540446934"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44693-1_44","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T05:10:18Z","timestamp":1181625018000},"page":"502-513","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for the Bottleneck Stretch Factor Problem"],"prefix":"10.1007","author":[{"given":"Giri","family":"Narasimhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,16]]},"reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1137\/0222051","volume":"22","author":"P. K. Agarwal","year":"1993","unstructured":"P. K. Agarwal and J. Matou\u0161ek. Ray shooting and parametric search. SIAM J. Comput., 22:794\u2013806, 1993.","journal-title":"SIAM J. Comput"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: short, thin, and lanky. In Proc. 27th Annu. ACM Sympos. Theory Comput., pages 489\u2013498, 1995.","DOI":"10.1145\/225058.225191"},{"key":"44_CR3","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"J. L. Bentley","year":"1979","unstructured":"J. L. Bentley. Decomposable searching problems. Inform. Process. Lett., 8:244\u2013251, 1979.","journal-title":"Inform. Process. Lett"},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","volume":"1","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley and J. B. Saxe. Decomposable searching problems I: Static-to-dynamic transformations. J. Algorithms, 1:301\u2013358, 1980.","journal-title":"J. Algorithms"},{"key":"44_CR5","volume-title":"Dealing with higher dimensions: the well-separated pair decomposition and its applications","author":"P. B. Callahan","year":"1995","unstructured":"P. B. Callahan. Dealing with higher dimensions: the well-separated pair decomposition and its applications. Ph.D. thesis, Dept. Comput. Sci., Johns Hopkins University, Baltimore, Maryland, 1995."},{"key":"44_CR6","unstructured":"P. B. Callahan and S. R. Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 291\u2013300, 1993."},{"key":"44_CR7","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. J. ACM, 42:67\u201390, 1995.","journal-title":"J. ACM"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"T. M. Chan. On enumerating and selecting distances. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 279\u2013286, 1998.","DOI":"10.1145\/276884.276916"},{"key":"44_CR9","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990."},{"key":"44_CR10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0925-7721(95)00009-7","volume":"5","author":"M. T. Dickerson","year":"1996","unstructured":"M. T. Dickerson and D. Eppstein. Algorithms for proximity problems in higher dimensions. Comput. Geom. Theory Appl., 5:277\u2013291, 1996.","journal-title":"Comput. Geom. Theory Appl"},{"key":"44_CR11","first-page":"425","volume-title":"Handbook of Computational Geometry","author":"D. Eppstein","year":"1999","unstructured":"D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425\u2013461. Elsevier Science, Amsterdam, 1999."},{"key":"44_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02573975","volume":"10","author":"J. Matou\u0161ek","year":"1993","unstructured":"J. Matou\u0161ek and O. Schwarzkopf. On ray shooting in convex polytopes. Discrete Comput. Geom., 10:215\u2013232, 1993.","journal-title":"Discrete Comput. Geom"},{"key":"44_CR13","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1137\/S0097539799361671","volume":"30","author":"G. Narasimhan","year":"2000","unstructured":"G. Narasimhan and M. Smid. Approximating the stretch factor of Euclidean graphs. SIAM J. Comput., 30:978\u2013989, 2000.","journal-title":"SIAM J. Comput"},{"key":"44_CR14","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1988","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, Berlin, 1988."},{"key":"44_CR15","first-page":"877","volume-title":"Handbook of Computational Geometry","author":"M. Smid","year":"1999","unstructured":"M. Smid. Closest-point problems in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 877\u2013935. Elsevier Science, Amsterdam, 1999."}],"container-title":["Lecture Notes in Computer Science","STACS 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44693-1_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T08:45:01Z","timestamp":1550393101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44693-1_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416951","9783540446934"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44693-1_44","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}