{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:29:05Z","timestamp":1737523745762,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423065"},{"type":"electronic","value":"9783540477389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47738-1_34","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T22:52:49Z","timestamp":1194389569000},"page":"362-369","source":"Crossref","is-referenced-by-count":3,"title":["Efficient algorithms for the minimum diameter bridge problem"],"prefix":"10.1007","author":[{"given":"Takeshi","family":"Tokuyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"34_CR1","unstructured":"Otfried Chong, private communication."},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"E. Cohen and N. Meggido, Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs, in Proceedings of 21st ACM Symposium on Theory of Computing (1989) 523\u2013534.","DOI":"10.1145\/73007.73057"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R. Cole","year":"1987","unstructured":"R. Cole, Slowing down sorting network to obtain faster sorting algorithms, J. ACM 34 (1987) 200\u2013208.","journal-title":"J. ACM"},{"key":"34_CR4","unstructured":"M. Deyer and N. Meggido, Linear programming in low dimensions, Section 38 of Handbook of Discrete and Computational Geometry (1997) 699\u2013710, CRC Press."},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"B. G\u00e4rtner, A subexponential algorithm for abstract optimization problems, Proc. 33rd FOCS (1992) 464\u2013472.","DOI":"10.1109\/SFCS.1992.267805"},{"key":"34_CR6","unstructured":"D. Gusfield, Sensitivity Analysis for Combinatorial Optimization, Memorandum No. UCB\/ERL M80\/22, U.C. Berkeley, 1980."},{"key":"34_CR7","unstructured":"S. K. Kim and C. S. Shin, Computing the optimal bridge between two polygons, HKUST Research Report TCSC-99-14 (1999) to appear in IPL."},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"J. Matuo\u0161sek, Efficient partition tress, Proceedings of 7th ACM Symposium on Computational Geometry (1991) 1\u20139.","DOI":"10.1145\/109648.109649"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Meggido","year":"1983","unstructured":"N. Meggido, Applying parallel computation algorithms in the design of serial algorithms, J. ACM 30 (1983) 852\u2013865.","journal-title":"J. ACM"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"J. Matou\u0161sek and O. Schwarzkopf, Linear optimization queries, Proceedings of 8th ACM Symposium on Computational Geometry (1992) 16\u201325.","DOI":"10.1145\/142675.142683"},{"key":"34_CR11","series-title":"Lect Notes Comput Sci","first-page":"569","volume-title":"Proc. 9th STACS","author":"M. Sharir","year":"1992","unstructured":"M. Sharir and E. Welzl, A combinatorial bound for linear programming and related problems, Proc. 9th STACS, LNCS 577 (1992) 569\u2013579."},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0020-0190(00)00143-5","volume":"76","author":"X. H. Tan","year":"2000","unstructured":"X. H. Tan, On optimal bridges between two convex regions, Information Processing Letters 76 (2000) 163\u2013168.","journal-title":"Information Processing Letters"},{"key":"34_CR13","unstructured":"T. Tokuyama, MaxMin parametric optimization problems and multidimensional parametric searching, Proceedings of 33rd ACM Symposium on Theory of Computing, to appear."}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47738-1_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T03:58:38Z","timestamp":1737518318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47738-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423065","9783540477389"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-47738-1_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}