{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:48Z","timestamp":1725664548690},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613329"},{"type":"electronic","value":"9783540684619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61332-3_134","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:33:50Z","timestamp":1330292030000},"page":"11-20","source":"Crossref","is-referenced-by-count":1,"title":["O(n log n)-average-time algorithm for shortest network under a given topology"],"prefix":"10.1007","author":[{"given":"Guoliang","family":"Xue","sequence":"first","affiliation":[]},{"given":"D. -Z.","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0020-0190(86)90062-1","volume":"22","author":"E.J. Cockayne","year":"1986","unstructured":"E.J. Cockayne and D.E. Hewgill, Exact computation of Steiner minimal trees in the Euclidean plane, Information Processing Letters, Vol. 22(1986), pp. 151\u2013156.","journal-title":"Information Processing Letters"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01758755","volume":"7","author":"D.-Z. Du","year":"1992","unstructured":"D.-Z. Du and F.K. Hwang, A proof of Gilbert-Pollak's conjecture on the Steiner ratio, Algorithmica, Vol. 7(1992), pp. 121\u2013135.","journal-title":"Algorithmica"},{"key":"2_CR3","unstructured":"D.-Z. Du, Y. Zhang and Q. Feng, On better heuristic for Euclidean Steiner minimum trees, In Proc. 32nd IEEE Symp. Found. Comp. Sci. (1991), pp. 431\u2013439."},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"M.R. Garey, R.L. Graham and D.S. Johnson, The complexity of computing Steiner minimal trees, SIAM Journal on Applied Mathematics, Vol. 32(1977), pp. 835\u2013859.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"E.N. Gilbert","year":"1968","unstructured":"E.N. Gilbert and H.O. Pollak, Steiner minimal trees, SIAM Journal on Applied Mathematics, Vol. 16(1968), pp. 1\u201329.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-6377(86)90008-8","volume":"4","author":"F.K. Hwang","year":"1986","unstructured":"F.K. Hwang, A linear time algorithm for full Steiner trees, Operations Research Letters, Vol. 4(1986), pp. 235\u2013237.","journal-title":"Operations Research Letters"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"F.K. Hwang, D.S. Richards and P. Winter, The Steiner Tree Problem, North-Holland, 1992.","DOI":"10.1002\/net.3230220105"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/0196-6774(92)90050-M","volume":"13","author":"F.K. Hwang","year":"1992","unstructured":"F.K. Hwang and J.F. Weng, The shortest network under a given topology, Journal of Algorithms, Vol. 13(1992), pp. 468\u2013488.","journal-title":"Journal of Algorithms"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.4153\/CMB-1961-016-2","volume":"16","author":"Z.A. Melzak","year":"1961","unstructured":"Z.A. Melzak, On the problem of Steiner, Canadian Mathematical Bulletin, Vol. 16(1961), pp. 143\u2013148.","journal-title":"Canadian Mathematical Bulletin"},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1137\/0150015","volume":"50","author":"D. Trietsch","year":"1990","unstructured":"D. Trietsch and F.K. Hwang, An improved algorithm for Steiner trees, SIAM Journal on Applied Mathematics, Vol. 50(1990), pp. 244\u2013263.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230150305","volume":"15","author":"P. Winter","year":"1985","unstructured":"P. Winter, An algorithm for the Steiner problem in the Euclidean plane, Networks, Vol. 15(1985), pp. 323\u2013345.","journal-title":"Networks"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"A. Zelikovsky","year":"1993","unstructured":"A. Zelikovsky, An 11\/6-approximation algorithm for the network Steiner problem, Algorithmica, Vol. 9(1993), pp. 463\u2013470.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61332-3_134.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:29Z","timestamp":1605647129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61332-3_134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613329","9783540684619"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-61332-3_134","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}