{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:27:12Z","timestamp":1649129232795},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1007\/s10878-005-5487-0","type":"journal-article","created":{"date-parts":[[2005,2,16]],"date-time":"2005-02-16T22:08:53Z","timestamp":1108591733000},"page":"101-120","source":"Crossref","is-referenced-by-count":3,"title":["Two Variations of the Minimum Steiner Problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Tsan-Sheng","family":"Hsu","sequence":"first","affiliation":[]},{"given":"Kuo-Hui","family":"Tsai","sequence":"additional","affiliation":[]},{"given":"Da-Wei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"D. T.","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230100207","volume":"10","author":"Y.P. Aneja","year":"1980","unstructured":"Y.P. Aneja ?An integer linear programming approachto the Steiner problem in graphs,?Networks, vol. 10, pp. 167?178, 1980.","journal-title":"Networks"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0166-218X(93)90086-4","volume":"47","author":"G. Dahl","year":"1993","unstructured":"G. Dahl ?Directed Steiner problems with connectivity constraints,?Discrete Applied Math., vol. 47, pp. 109?128, 1993.","journal-title":"Discrete Applied Math."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1972","unstructured":"S.E. Dreyfus and R.A. Wagner ?The Steiner problem in graphs,?Networks, vol. 1, pp. 195?207, 1972.","journal-title":"Networks"},{"issue":"3","key":"CR4","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"M.L. Fredman and R.E. Tarjan ?Fibonacci heaps and their uses in improved network optimization algorithms,?Journal of ACM, vol. 34, no. 3, pp. 596?615, 1987.","journal-title":"Journal of ACM"},{"issue":"2","key":"CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"H.N. Gabow","year":"1986","unstructured":"H.N. Gabow, Z. Galil, T. Spencer, and R.E. Tarjan ?Efficient algorithms for finding minimum spanning trees in undirected and directed graphs,?Combinatorica, vol. 6, no. 2, pp. 109?122, 1986.","journal-title":"Combinatorica"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"S.L. Hakimi","year":"1971","unstructured":"S.L. Hakimi ?Steiner?s problem in graphs and its applications,?Networks, vol. 1, pp. 113?133, 1971.","journal-title":"Networks"},{"key":"CR7","first-page":"21","volume-title":"in Lecture Notes in Computer Science 1090: Proceedings of the 2nd International Symposium on Computing and Combinatorics","author":"T.-S. Hsu","year":"1996","unstructured":"T.-S. Hsu, K.-H. Tsai, D.-W. Wang, and D.T. Lee ?Steiner problems on directed acyclic graphs,?in Lecture Notes in Computer Science 1090: Proceedings of the 2nd International Symposium on Computing and Combinatorics, J.Y. Cai and C.K. Wong (Ed.), Springer-Verlag: New York, NY, 1996, pp. 21?30."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"F.K. Hwang","year":"1992","unstructured":"F.K. Hwang and D.S. Richards ?Steiner tree problems,?Networks, vol. 22, pp. 55?89, 1992.","journal-title":"Networks"},{"key":"CR9","unstructured":"F.K. Hwang, D.S. Richards, and P. Winter The Steiner Tree Problem, Annals of Discrete Mathematics, vol. 53, North-Holland, 1992."},{"key":"CR10","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston: New York, 1976."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/net.3230120202","volume":"12","author":"S. Martello","year":"1982","unstructured":"S. Martello and P. Toth ?Finding a minimum equivalent graph of a digraph,?Networks, vol.12, pp. 89?100, 1982.","journal-title":"Networks"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"L. Nastansky, S.M. Selkow, and N.F. Stewart ?Cost-minimal trees in directed acyclic graphs,? Zeitschrift f\u00fcr Operations Research, 1974, pp. 59?67.","DOI":"10.1007\/BF01949715"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"S.K. Rao, P. Sadayappan, F.K. Hwang, and P.W. Shor ?The rectilinear Steiner arborescence problem,?Algorithmica, 1992, pp. 277?288.","DOI":"10.1007\/BF01758762"},{"key":"CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"R.E. Tarjan Data Structures and Network Algorithms, SIAM Press, Philadelphia, PA, 1983."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0020-0190(93)90185-C","volume":"48","author":"S. Voss","year":"1993","unstructured":"S. Voss ?Worst-case performance of some heuristics for Steiner?s problem in directed graphs,? Information Processing Letters, vol. 48, pp. 99?105, 1993.","journal-title":"Information Processing Letters"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"P. Winter ?Steiner problem in networks: A survey,?Networks, vol. 17, pp. 129?167, 1987.","journal-title":"Networks"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R.T. Wong","year":"1984","unstructured":"R.T. Wong ?A dual ascent approach for Steiner tree problems on a directed graphs,?Mathematical Programming, vol. 28, pp. 271?287, 1984.","journal-title":"Mathematical Programming"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-5487-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-5487-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-5487-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:06:13Z","timestamp":1586117173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-5487-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["5487"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-5487-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}