{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T07:25:05Z","timestamp":1649057105504},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-6","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1007\/bf01758763","type":"journal-article","created":{"date-parts":[[2005,6,15]],"date-time":"2005-06-15T06:49:08Z","timestamp":1118818148000},"page":"289-302","source":"Crossref","is-referenced-by-count":0,"title":["Two new criteria for finding Steiner hulls in Steiner tree problems"],"prefix":"10.1007","volume":"7","author":[{"given":"J. Scott","family":"Provan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01758763_CR1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230070104","volume":"7","author":"A. V. Aho","year":"1977","unstructured":"Aho, A. V., M. R. Garey, and H. W. Hwang (1977). Rectilinear Steiner trees: efficient special-case algorithms,Networks 7, 37\u201358.","journal-title":"Networks"},{"key":"BF01758763_CR2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/net.3230190107","volume":"19","author":"D. Bienstock","year":"1989","unstructured":"Bienstock, D., and C. L. Monma (1989). Optimal enclosing regions in planar graphs,Networks 19, 79\u201394.","journal-title":"Networks"},{"key":"BF01758763_CR3","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1137\/0118014","volume":"18","author":"E. J. Cockayne","year":"1970","unstructured":"Cockayne, E. J. (1970). On the efficiency of the algorithm for Steiner minimal trees,SIAM J. Appl. Math. 18, 150\u2013159.","journal-title":"SIAM J. Appl. Math."},{"key":"BF01758763_CR4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-6377(89)90005-9","volume":"8","author":"C. W. Duin","year":"1089","unstructured":"Duin, C. W., and A. Volgenant (1089). An edge elimination test for the Steiner problem in graphs,Oper. Res. Lett. 8, 79\u201383.","journal-title":"Oper. Res. Lett."},{"key":"BF01758763_CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"E. W. Dreyfus","year":"1972","unstructured":"Dreyfus, E. W., and R. A. Wagner (1972). The Steiner problem in graphs,Networks 1, 195\u2013207.","journal-title":"Networks"},{"key":"BF01758763_CR6","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","volume":"12","author":"R. E. Erickson","year":"1987","unstructured":"Erickson, R. E., C. L. Monma, and A. F. Vienott (1987). Send-and-split method for minimum concave-cost network flows,Math. Oper. Res. 12, 634\u2013664.","journal-title":"Math. Oper. Res."},{"key":"BF01758763_CR7","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"Fredman, M. L., and R. E. Tarjan (1987). Fibonacci heaps and their uses in improved network optimization algorithms,J. Assoc. Comput. Mach. 34, 596\u2013615.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01758763_CR8","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"M. R. Garey","year":"1977","unstructured":"Garey, M. R., R. L. Graham, and D. S. Johnson (1977). The complexity of computing Steiner minimal trees,SIAM J. Appl. Math. 32, 835\u2013859.","journal-title":"SIAM J. Appl. Math."},{"key":"BF01758763_CR9","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M. R. Garey","year":"1977","unstructured":"Garey, M. R., and D. S. Johnson (1977). The rectilinear Steiner tree problem is NP-complete,SIAM J. Appl. Math. 32, 826\u2013834.","journal-title":"SIAM J. Appl. Math."},{"key":"BF01758763_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"E. N. Gilbert","year":"1968","unstructured":"Gilbert, E. N., and H. O. Pollak (1968). Steiner minimal trees,SIAM J. Appl. Math. 16, 1\u201329.","journal-title":"SIAM J. Appl. Math."},{"key":"BF01758763_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"S. L. Hakimi","year":"1971","unstructured":"Hakimi, S. L. (1971). Steiner's problem in graphs and its implications,Networks 1, 113\u2013133.","journal-title":"Networks"},{"key":"BF01758763_CR12","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0114025","volume":"14","author":"M. Hanan","year":"1966","unstructured":"Hanan, M. (1966). On Steiner's problem with rectilinear distance,SIAM J. Appl. Math. 14, 255\u2013265.","journal-title":"SIAM J. Appl. Math."},{"key":"BF01758763_CR13","unstructured":"Hwang, F. K., and D. S. Richards (1989). Steiner tree problems,Networks, to appear."},{"key":"BF01758763_CR14","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF02187919","volume":"3","author":"F. K. Hwang","year":"1988","unstructured":"Hwang, F. K., G. D. Song, G. Y. Ting, and D. Z. Hu (1988). A decomposition theorem on Euclidean Steiner minimal trees,Discrete and Comput. Geom. 3, 367\u2013382.","journal-title":"Discrete and Comput. Geom."},{"key":"BF01758763_CR15","doi-asserted-by":"crossref","first-page":"143","DOI":"10.4153\/CMB-1961-016-2","volume":"4","author":"Z. A. Melzak","year":"1961","unstructured":"Melzak, Z. A. (1961). On the problem of Steiner,Canad. Math. Bull. 4, 143\u2013148.","journal-title":"Canad. Math. Bull."},{"key":"BF01758763_CR16","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230180108","volume":"18","author":"J. S. Provan","year":"1988","unstructured":"Provan, J. S. (1988). Convexity and the Steiner tree problem,Networks 18, 55\u201372.","journal-title":"Networks"},{"key":"BF01758763_CR17","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1137\/0217057","volume":"17","author":"J. S. Provan","year":"1988","unstructured":"Provan, J. S. (1988). An approximation scheme for finding Steiner trees with obstacles,SIAM J. Comput. 17, 920\u2013934.","journal-title":"SIAM J. Comput."},{"key":"BF01758763_CR18","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(89)90129-4","volume":"30","author":"J. S. Provan","year":"1989","unstructured":"Provan, J. S. (1989). Shortest enclosing walks and cycles in embedded graphs,Inform. Process. Lett. 30, 119\u2013125.","journal-title":"Inform. Process. Lett."},{"key":"BF01758763_CR19","unstructured":"Provan, J. S. (1989). The Role of Steiner Hulls in the Solution to Steiner Tree Problems,Proceedings of the NATO Advanced Research Workshop on Topological Network Design: Analysis and Synthesis. To appear inAnnals of Operations Research."},{"key":"BF01758763_CR20","unstructured":"Smith, J. M., and P. Winter (1989). Computational geometry and topological network design,Proceedings of the NATO Advanced Research Workshop on Topological Network Design: Analysis and Synthesis. To appear inAnnals of Operations Research."},{"key":"BF01758763_CR21","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230150305","volume":"15","author":"P. Winter","year":"1985","unstructured":"Winter, P. (1985). An algorithm for the Steiner problem in the Euclidean plane.Networks 15, 323\u2013345.","journal-title":"Networks"},{"key":"BF01758763_CR22","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"Winter, P. (1987). Steiner problem in networks: a survey.Networks 17, 129\u2013167.","journal-title":"Networks"},{"key":"BF01758763_CR23","unstructured":"Yang, Y. Y., and O. Wing (1972). Optimal and suboptimal algorithms for the wiring problem,Proc. IEEE International Symposium on Circuit Theory, pp. 154\u2013158."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01758763.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01758763\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01758763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T12:25:40Z","timestamp":1557318340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01758763"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":23,"journal-issue":{"issue":"1-6","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF01758763"],"URL":"https:\/\/doi.org\/10.1007\/bf01758763","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}