{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:50:39Z","timestamp":1725511839492},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540718048"},{"type":"electronic","value":"9783540718055"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71805-5_5","type":"book-chapter","created":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T13:01:18Z","timestamp":1182344478000},"page":"42-51","source":"Crossref","is-referenced-by-count":9,"title":["An Ant Algorithm for the Steiner Tree Problem in Graphs"],"prefix":"10.1007","author":[{"given":"Luc","family":"Luyet","sequence":"first","affiliation":[]},{"given":"Sacha","family":"Varone","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Zufferey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J. Beasley","year":"1990","unstructured":"Beasley, J.: Or-library: Distributing test problems by electronic mail. Journal of the Operational Research Society\u00a041, 1069\u20131072 (1990)","journal-title":"Journal of the Operational Research Society"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/A:1009625526657","volume":"5","author":"P. Calegari","year":"1999","unstructured":"Calegari, P., Coray, C., Hertz, A., Kobler, D., Kuonen, P.: A taxonomy of evolutionary algorithms in combinatorial optimization. Journal of Heuristics\u00a05, 145\u2013158 (1999)","journal-title":"Journal of Heuristics"},{"issue":"1","key":"5_CR3","first-page":"73","volume":"74","author":"G. Chen","year":"1993","unstructured":"Chen, G., Houle, M., Kuo, M.: The steiner problem in distributed computing systems. Information Sciences\u00a074(1), 73\u201396 (1993)","journal-title":"Information Sciences"},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-9260(96)00008-9","volume":"21","author":"J. Cong","year":"1996","unstructured":"Cong, J., He, L., Koh, C., Madden, P.: Performance optimization of vlsi interconnect layout. Integration: the VLSI Journal\u00a021, 1\u201394 (1996)","journal-title":"Integration: the VLSI Journal"},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/78952.78953","volume":"8","author":"S. Deering","year":"1990","unstructured":"Deering, S., Cheriton, D.: Multicast routing in datagram internetworks and extended lans. ACM Transaction on Computer Systems\u00a08(2), 85\u2013110 (1990)","journal-title":"ACM Transaction on Computer Systems"},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/65.777437","volume":"13","author":"C. Diot","year":"1999","unstructured":"Diot, C., Gautier, L.: A distributed architecture for multiplayer interactive applications on the internet. IEEE Network\u00a013(4), 6\u201315 (1999)","journal-title":"IEEE Network"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01, 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G., Gambardella, L.: Ant algorithms for discrete optimization. Artificial Life\u00a05, 137\u2013172 (1999)","journal-title":"Artificial Life"},{"key":"5_CR9","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy. Technical Report 91-016, Politecnico di Milano, Dipartimento di Elettronica, Italy (1991)"},{"key":"5_CR10","unstructured":"Dorigo, M.: Optimization, learning and natural algorithms (in Italian). Ph.D. Dissertation, Politecnico di Milano, Dipartimento di Elettronica, Italy (1992)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/03052159108941063","volume":"17","author":"K. Dowsland","year":"1991","unstructured":"Dowsland, K.: Hill-climbing simulated annealing and the steiner problem in graphs. Engineering Optimization\u00a017, 91\u2013107 (1991)","journal-title":"Engineering Optimization"},{"key":"5_CR12","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: An. International Journal\u00a026, 173\u2013185 (1995)","journal-title":"Networks: An International Journal"},{"issue":"5","key":"5_CR13","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/MCG.2002.1028728","volume":"22","author":"H. Fisher","year":"2002","unstructured":"Fisher, H.: Multicast issues for collaborative virtual environments. IEEE Computer Graphics and Applications\u00a022(5), 68\u201375 (2002)","journal-title":"IEEE Computer Graphics and Applications"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MMUL.2002.1041946","volume":"9","author":"D. Foreman","year":"2002","unstructured":"Foreman, D.: Managing data in distributed multimedia conferencing applications. IEEE Multimedia\u00a09(4), 30\u201337 (2002)","journal-title":"IEEE Multimedia"},{"key":"5_CR15","unstructured":"Gambardella, L.M., Dorigo, M.: HAS-SOP: An hybrid ant system for the sequential ordering problem. Tech. Rep. 11-97, Lugano, Switzerland: IDSIA (1997)"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1002\/(SICI)1097-0037(199909)34:2<162::AID-NET9>3.0.CO;2-9","volume":"34","author":"M. Gendreau","year":"1999","unstructured":"Gendreau, M., Larochelle, J.-F., Sans\u00f2, B.: A tabu search heuristic for the steiner tree problem. Networks\u00a034(2), 162\u2013172 (1999)","journal-title":"Networks"},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1137\/0114025","volume":"14","author":"M. Hanan","year":"1966","unstructured":"Hanan, M.: On steiner\u2019s problem with rectilinear distance. SIAM Journal of Applied Mathematics\u00a014(2), 255\u2013265 (1966)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-9260(01)00020-7","volume":"31","author":"J. Hu","year":"2001","unstructured":"Hu, J., Sapatnekar, S.S.: A survey on multi-net global routing for integrated circuits. Integration: The. VLSI Journal\u00a031, 1\u201349 (2001)","journal-title":"Integration: The VLSI Journal"},{"key":"5_CR19","unstructured":"Hwang, F., Richards, D., Winter, R.: The Steiner tree problem, volume\u00a053 of Ann. of Discrete Math. Amsterdam: North-Holland (1992)"},{"issue":"3","key":"5_CR20","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M. Imase","year":"1991","unstructured":"Imase, M., Waxman, B.M.: Dynamic steiner tree problem. SIAM J. Discrete Math.\u00a04(3), 369\u2013384 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1057\/jors.1993.69","volume":"44","author":"A. Kapsalis","year":"1993","unstructured":"Kapsalis, A., Rayward-Smith, V., Smith, G.: Solving the graphical steiner tree problem using genetic algorithms. Journal of the Operational Research Society\u00a044, 397\u2013406 (1993)","journal-title":"Journal of the Operational Research Society"},{"key":"5_CR22","first-page":"85","volume-title":"Reducibility among combinatorial problems","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"5_CR23","unstructured":"Kompella, V., Pasquale, J., and Polyzos, G.: Two distributed algorithms for the constrained steiner tree problem. In: Proceedings of the Second International Conference on Computer Communications and Networking (ICCCN\u201993), pp. 343\u2013349(1993)"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L. Kou","year":"1981","unstructured":"Kou, L., Markowsky, G., Berman, L.: A fast algorithm for steiner trees. Acta Informatica\u00a015, 141\u2013145 (1981)","journal-title":"Acta Informatica"},{"issue":"9","key":"5_CR25","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1109\/35.948422","volume":"39","author":"N. Mir","year":"2001","unstructured":"Mir, N.: A survey of data multicast techniques, architectures, and algorithms. IEEE Communications Magazine\u00a039(9), 164\u2013170 (2001)","journal-title":"IEEE Communications Magazine"},{"issue":"8","key":"5_CR26","doi-asserted-by":"publisher","first-page":"1953","DOI":"10.1016\/j.cor.2003.12.007","volume":"32","author":"C.A.S. Oliveira","year":"2005","unstructured":"Oliveira, C.A.S., Pardalos, P.M.: A survey of combinatorial optimization problems in multicast routing. Comput. Oper. Res.\u00a032(8), 1953\u20131981 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"5_CR27","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s005300050075","volume":"6","author":"J. Pasquale","year":"1998","unstructured":"Pasquale, J., Polyzos, G.C., Xylomenos, G.: The multimedia multicasting problem. Multimedia Systems\u00a06(1), 43\u201359 (1998)","journal-title":"Multimedia Systems"},{"issue":"1","key":"5_CR28","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s005300050075","volume":"6","author":"T. Polzin","year":"1998","unstructured":"Polzin, T., Daneshmand, S.V.: The multimedia multicasting problem. Multimedia Systems\u00a06(1), 43\u201359 (1998)","journal-title":"Multimedia Systems"},{"issue":"4","key":"5_CR29","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1109\/90.793020","volume":"7","author":"S. Raghavan","year":"1999","unstructured":"Raghavan, S., Manimaran, G., Murthy, C.S.R.: A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees. IEEE\/ACM Trans. Netw.\u00a07(4), 514\u2013529 (1999)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"5_CR30","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1002\/1097-0037(200009)36:2<138::AID-NET9>3.0.CO;2-U","volume":"36","author":"C.C. Ribeiro","year":"2000","unstructured":"Ribeiro, C.C., Souza, M.C.D.: Tabu search for the steiner problem in graphs. Networks\u00a036(2), 138\u2013146 (2000)","journal-title":"Networks"},{"issue":"3","key":"5_CR31","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"C.C. Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid grasp with perturbations for the steiner problem in graphs. INFORMS J. on Computing\u00a014(3), 228\u2013246 (2002)","journal-title":"INFORMS J. on Computing"},{"issue":"3","key":"5_CR32","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1109\/49.564135","volume":"15","author":"A. Shaikh","year":"1997","unstructured":"Shaikh, A., Shin, K.G.: Destination-driven routing for low-cost multicast. IEEE Journal of Selected Areas in Communications\u00a015(3), 373\u2013381 (1997)","journal-title":"IEEE Journal of Selected Areas in Communications"},{"key":"5_CR33","first-page":"309","volume-title":"Proceedings of IEEE-ICEC-EPS\u201997.","author":"T. Stuetzle","year":"1997","unstructured":"Stuetzle, T., Hoos, H.: The MAX-MIN Ant System and local search for the traveling salesman problem. In: Baeck, T., Michalewicz, Z., Yao, X. (eds.) Proceedings of IEEE-ICEC-EPS\u201997., pp. 309\u2013314. IEEE Press, Piscataway, NJ (1997)"},{"issue":"6","key":"5_CR34","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. Japonica\u00a024(6), 573\u2013577 (1980)","journal-title":"Math. Japonica"},{"key":"5_CR35","unstructured":"Voss, S., Martin, A., Koch, T.: Steinlib testdata library. online"},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0166-218X(92)90021-2","volume":"40","author":"S. Voss","year":"1992","unstructured":"Voss, S.: Steiner\u2019s problem in graphs: Heuristic methods. Discrete Applied Mathematics\u00a040, 45\u201372 (1992)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutinary Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71805-5_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:26:50Z","timestamp":1605745610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71805-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540718048","9783540718055"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71805-5_5","relation":{},"subject":[]}}