{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T20:38:27Z","timestamp":1754599107141,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424949"},{"type":"electronic","value":"9783540446798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44679-6_57","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T17:00:37Z","timestamp":1265734837000},"page":"509-518","source":"Crossref","is-referenced-by-count":26,"title":["The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points"],"prefix":"10.1007","author":[{"given":"Dingzhu","family":"Du","sequence":"first","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Baogang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,31]]},"reference":[{"key":"57_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1008384012064","volume":"18","author":"D. Chen","year":"2000","unstructured":"D. Chen, D.-Z. Du, X.. Hu, G. Lin, L. Wang and G. Xue, \u201cApproximations for Steiner trees with minimum number of Steiner points\u201d, Journal of Global Optimization, vol. 18, pp. 17\u201333, 2000.","journal-title":"Journal of Global Optimization"},{"key":"57_CR2","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1109\/43.62776","volume":"19","author":"C. Chiang","year":"1990","unstructured":"C. Chiang, M. Sarrafzadeh and C.K. Wong, \u201cA powerful global router: based on Steiner min-max tree\u201d, IEEE Transactions on Computer-Aided Design, 19, pp. 1318\u20131325, 1990.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"57_CR3","unstructured":"C.-S. Li, F.F. Tong, C.J. Georgiou and M. Chen, Gain equalization in metropolitan and wide area optical networks using optical amplifiers, Proc. IEEE INFOCOM\u201994, pp. 130\u2013137, June 1994."},{"key":"57_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0020-0190(98)00201-4","volume":"69","author":"G. Lin","year":"1999","unstructured":"G. Lin and G. Xue, \u201cSteiner tree problem with minimum number of Steiner points and bounded edge-length\u201d, Information ProcessingL etters, 69, pp. 53\u201357, 1999.","journal-title":"Information ProcessingL etters"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"B. Ramamurthy, J. Iness and B. Mukherjee, Minimizing the number of optical amplifiers needed to support a multi-wavelength optical LAN\/MAN, Proc. IEEE INFOCOM\u201997, pp. 261\u2013268, April 1997.","DOI":"10.1109\/INFCOM.1997.635138"},{"key":"57_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1006\/jagm.2000.1086","volume":"36","author":"H.J. Pr\u00f6mel","year":"2000","unstructured":"H.J. Pr\u00f6mel and A. Steger, \u201cA NewAppro ximation Algorithm for the Steiner Tree Problem with Performance Ratio 5\/3\u201d, Journal of Algorithms, 36, pp. 89\u2013101, 2000.","journal-title":"Journal of Algorithms"},{"key":"57_CR7","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/12.127452","volume":"41","author":"M. Sarrafzadeh","year":"1992","unstructured":"M. Sarrafzadeh and C.K. Wong, \u201cBottleneck Steiner trees in the plane\u201d, IEEE Transactions on Computers, 41, pp. 370\u2013374, 1992.","journal-title":"IEEE Transactions on Computers"},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"L. Wang and D.-Z. Du, \u201cApproximations for a Bottleneck Steiner Tree Problem\u201d, Algorithmica, to appear.","DOI":"10.1007\/s00453-001-0089-4"},{"key":"57_CR9","unstructured":"L. wang and Z. Li, \u201cAn Approximation Algorithm for a Bottleneck Steiner Tree Problem in the Euclidean Plane\u201d, Information ProcessingL etters, to appear."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44679-6_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T03:32:27Z","timestamp":1739849547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44679-6_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424949","9783540446798"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44679-6_57","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}