{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:33:15Z","timestamp":1725485595283},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651420"},{"type":"electronic","value":"9783540495437"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49543-6_22","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T22:58:05Z","timestamp":1181170685000},"page":"280-293","source":"Crossref","is-referenced-by-count":1,"title":["A High Performance Approximate Algorithm for the Steiner Problem in Graphs"],"prefix":"10.1007","author":[{"given":"Pere","family":"Guitart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josep M.","family":"Basart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"22_CR1","unstructured":"Alexander, M. J., Cohhon, J. P., Ganley, J. L., Robins, G.: An Architecture-Independent Approach to FPGA Routing Based on Multi-Weighted Graphs. Proc. of The European Design Automation Conference (1994) 259\u2013264"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1038\/sj\/jors\/0411109","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Opl. Res. Soc. 41 (1990) 1069\u20131072","journal-title":"J. Opl. Res. Soc."},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/net.3230260403","volume":"26","author":"H. Esbensen","year":"1995","unstructured":"Esbensen, H.: Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm. Networks 26 (1995) 173\u2013185","journal-title":"Networks"},{"key":"22_CR4","unstructured":"Esbensen, H.: Finding (Near-)Optimal Steiner Trees in Large Graphs. Proc. of the Sixth International Conference on Genetic Algorithms (1995) 485\u2013491."},{"key":"22_CR5","unstructured":"Guitart, P., Basart, J.M.: A Genetic Algorithm Approach for the Steiner Problem in Graphs. EUFIT\u201998 Proc. of the Sixth European Congress on Intelligent Techniques and Soft Computing (1998) (to appear)."},{"key":"22_CR6","volume-title":"Annals of Discrete Matematics","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem, Annals of Discrete Matematics. 53 North-Holland, Amsterdam, The Netherlands (1992)"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1009758919736","volume":"1","author":"M. Karpinski","year":"1997","unstructured":"Karpinski, M., Zelikovsky, A.Z.: New Approximation Algorithms for the Steiner Tree Problems. Journal of Combinatorial Optimization 1 (1997) 1\u201319","journal-title":"Journal of Combinatorial Optimization"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1002\/net.3230160305","volume":"16","author":"V.J. Rayward-Smith","year":"1986","unstructured":"Rayward-Smith, V.J., Clare, A.: On finding Steiner Vertices. Networks 16 (1986) 283\u2013294","journal-title":"Networks"},{"key":"22_CR9","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"Takahashi H., Matsuyama A.: An approximate solution for the Steiner problem in graphs. Math. Jap. 24 (1980) 573\u2013577","journal-title":"Math. Jap."},{"key":"22_CR10","first-page":"335","volume":"40","author":"S. Vo\u0392","year":"1997","unstructured":"Vo\u0392, S., Gutenschwager, K.: A Chunking Based Genetic Algorithm for the Steiner Tree Problem in Graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 40 (1997) 335\u2013355","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49543-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T01:47:33Z","timestamp":1550368053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49543-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651420","9783540495437"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-49543-6_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}