{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:25:24Z","timestamp":1762176324885},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_10","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T02:34:01Z","timestamp":1234233241000},"page":"105-116","source":"Crossref","is-referenced-by-count":4,"title":["On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem"],"prefix":"10.1007","author":[{"given":"Sang Won","family":"Bae","sequence":"first","affiliation":[]},{"given":"Chunseok","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Sunghee","family":"Choi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacrist\u00e1n, V.: The farthest color Voronoi diagram and related problems. Technical Report 002, Institut f\u00fcr Informatik I, Rheinische Fridrich-Wilhelms-Universit\u00e4t Bonn (2006)"},{"key":"10_CR2","first-page":"80","volume-title":"Proc. 15th Annu. ACM Sympos. Theory Comput. (STOC)","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proc. 15th Annu. ACM Sympos. Theory Comput (STOC), pp. 80\u201386. ACM, New York (1983)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Chiang, C., Sarrafzadeh, M., Wong, C.: A powerful global router: based on Steiner min-max trees. In: Proc. IEEE Int. Conf. CAD, pp. 2\u20135 (1989)","DOI":"10.1109\/ICCAD.1989.76892"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1287\/trsc.10.4.321","volume":"10","author":"J. Elzinga","year":"1976","unstructured":"Elzinga, J., Hearn, D., Randolph, W.: Minimax multifacility location with Euclidean distances. Transport. Sci.\u00a010, 321\u2013336 (1976)","journal-title":"Transport. Sci."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0167-6377(96)00028-4","volume":"19","author":"J.L. Ganlet","year":"1996","unstructured":"Ganlet, J.L., Salowe, J.S.: Optimal and approximate bottleneck Steiner trees. Oper. Res. Lett.\u00a019, 217\u2013224 (1996)","journal-title":"Oper. Res. Lett."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02189323","volume":"9","author":"D.P. Huttenlocher","year":"1993","unstructured":"Huttenlocher, D.P., Kedem, K., Shrir, M.: The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom.\u00a09, 267\u2013291 (1993)","journal-title":"Discrete Comput. Geom."},{"issue":"6","key":"10_CR7","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/BF02973441","volume":"19","author":"Z.-M. Li","year":"2004","unstructured":"Li, Z.-M., Zhu, D.-M., Ma, S.-H.: Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane. J. Comput. Sci. Tech.\u00a019(6), 791\u2013794 (2004)","journal-title":"J. Comput. Sci. Tech."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/00207547308929944","volume":"11","author":"R. Love","year":"1973","unstructured":"Love, R., Wesolowsky, G., Kraemer, S.: A multifacility minimax location problem with Euclidean distances. J. Prod. Res.\u00a011, 37\u201345 (1973)","journal-title":"J. Prod. Res."},{"key":"10_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, Heidelberg (1985)"},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/12.127452","volume":"41","author":"M. Sarrafzadeh","year":"1992","unstructured":"Sarrafzadeh, M., Wong, C.: Bottleneck Steiner trees in the plane. IEEE Trans. Comput.\u00a041(3), 370\u2013374 (1992)","journal-title":"IEEE Trans. Comput."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/s00453-001-0089-4","volume":"32","author":"L. Wang","year":"2002","unstructured":"Wang, L., Du, D.-Z.: Approximations for a bottleneck Steiner tree problem. Algorithmica\u00a032, 554\u2013561 (2002)","journal-title":"Algorithmica"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0020-0190(01)00209-5","volume":"81","author":"L. Wang","year":"2002","unstructured":"Wang, L., Li, Z.: An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane. Inform. Process. Lett.\u00a081, 151\u2013156 (2002)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T02:43:05Z","timestamp":1551753785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}