{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:46:23Z","timestamp":1759146383904},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439776"},{"type":"electronic","value":"9783540456438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45643-0_1","type":"book-chapter","created":{"date-parts":[[2007,9,25]],"date-time":"2007-09-25T00:58:33Z","timestamp":1190681913000},"page":"1-15","source":"Crossref","is-referenced-by-count":18,"title":["On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs"],"prefix":"10.1007","author":[{"given":"Marcus Poggi","family":"de Arag\u00e3o","sequence":"first","affiliation":[]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,12]]},"reference":[{"key":"1_CR1","unstructured":"R. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, algorithms, and applications. Prentice-Hall, 1993."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","volume":"34","author":"C. Duin","year":"1999","unstructured":"C. Duin and S. Voss. The Pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Networks, 34:181\u2013191, 1999.","journal-title":"Networks"},{"key":"1_CR3","series-title":"Annals of Discrete Mathematics","volume-title":"The Steiner tree problem","author":"F. Hwang","year":"1992","unstructured":"F. Hwang, D. Richards, and P. Winter. The Steiner tree problem, volume 53 of Annals of Discrete Mathematics. North-Holland, Amsterdam, 1992."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","volume":"32","author":"T. Koch","year":"1998","unstructured":"T. Koch and A. Martin. Solving Steiner tree problems in graphs to optimality. Networks, 32:207\u2013232, 1998.","journal-title":"Networks"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"T. Koch, A. Martin, and S. Voss. SteinLib: An updated library on Steiner tree problems in graphs. Technical Report ZIB-Report 00-37, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, 2000. http:\/\/elib.zib.de\/steinlib .","DOI":"10.1007\/978-1-4613-0255-1_9"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K. Melhorn","year":"1988","unstructured":"K. Melhorn. A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters, 27:125\u2013128, 1988.","journal-title":"Information Processing Letters"},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/dimacs\/015\/09","volume":"15","author":"B. M. E. Moret","year":"1994","unstructured":"B. M. E. Moret and H. D. Shapiro. An empirical assessment of algorithms for constructing a minimum spanning tree. DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science, 15:99\u2013117, 1994.","journal-title":"DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science"},{"issue":"1\u20133","key":"1_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0166-218X(00)00319-X","volume":"112","author":"T. Polzin","year":"2001","unstructured":"T. Polzin and S. V. Daneshmand. Improved algorithms for the Steiner problem in networks. Discrete Applied Mathematics, 112(1\u20133):263\u2013300, 2001.","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"C. C. Ribeiro, E. Uchoa, and R. F. Werneck. A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing, to appear.","DOI":"10.1287\/ijoc.14.3.228.116"},{"key":"1_CR11","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"H. Takahashi and A. Matsuyama. An approximate solution for the Steiner problem in graphs. Math. Japonica, 24:573\u2013577, 1980.","journal-title":"Math. Japonica"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0166-218X(92)90021-2","volume":"40","author":"S. Voss","year":"1992","unstructured":"S. Voss. Steiner\u2019s problem in graphs: Heuristic methods. Discrete Applied Mathematics, 40:45\u201372, 1992.","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR13","unstructured":"S.M. Wang. A multiple source algorithm for suboptimum Steiner trees in graphs. In H. Noltemeier, editor, Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science, pages 387\u2013396. W\u00fcrzburg, 1985."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering and Experiments"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45643-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T07:53:43Z","timestamp":1556870023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45643-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439776","9783540456438"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45643-0_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}