{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:50:37Z","timestamp":1725551437936},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121388"},{"type":"electronic","value":"9783642121395"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12139-5_24","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T14:46:40Z","timestamp":1270046800000},"page":"276-287","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Steffen","family":"Wolf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Merz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"24_CR1","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/0203015","volume":"3","author":"T.C. Hu","year":"1974","unstructured":"Hu, T.C.: Optimum Communication Spanning Trees. SIAM Journal of Computing\u00a03(3), 188\u2013195 (1974)","journal-title":"SIAM Journal of Computing"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"D.S. Johnson","year":"1978","unstructured":"Johnson, D.S., Lenstra, J.K., Rinnooy Kan, A.H.G.: The Complexity of the Network Design Problem. Networks\u00a08, 279\u2013285 (1978)","journal-title":"Networks"},{"key":"24_CR3","volume-title":"Computers and Intractibility: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractibility: A guide to the theory of NP-completeness. W. H. Freeman and Co., San Francisco (1979)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/11844297_28","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"P. Merz","year":"2006","unstructured":"Merz, P., Wolf, S.: Evolutionary Local Search for Designing Peer-to-Peer Overlay Topologies based on Minimum Routing Cost Spanning Trees. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol.\u00a04193, pp. 272\u2013281. Springer, Heidelberg (2006)"},{"issue":"3","key":"24_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1287\/trsc.21.3.163","volume":"21","author":"R.K. Ahuja","year":"1987","unstructured":"Ahuja, R.K., Murty, V.V.S.: Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem. Transportation Science\u00a021(3), 163\u2013170 (1987)","journal-title":"Transportation Science"},{"key":"24_CR6","volume-title":"Discrete Mathematics and its Applications","author":"B.Y. Wu","year":"2004","unstructured":"Wu, B.Y., Chao, K.M.: Spanning Trees and Optimization Problems. In: Discrete Mathematics and its Applications. Chapman & Hall\/CRC, Boca Raton (2004)"},{"issue":"3","key":"24_CR7","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/S009753979732253X","volume":"29","author":"B.Y. Wu","year":"1999","unstructured":"Wu, B.Y., Lancia, G., Bafna, V., Chao, K.M., Ravi, R., Tang, C.Y.: A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees. SIAM Journal of Computing\u00a029(3), 761\u2013778 (1999)","journal-title":"SIAM Journal of Computing"},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/ICIT.2008.16","volume-title":"International Conference on Information Technology (ICIT 2008)","author":"A. Singh","year":"2008","unstructured":"Singh, A.: A New Heuristic for the Minimum Routing Cost Spanning Tree Problem. In: International Conference on Information Technology (ICIT 2008), pp. 9\u201313. IEEE Computer Society, Los Alamitos (2008)"},{"key":"24_CR9","series-title":"International Series in Operations Research & Management Science","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"H.R. Louren\u00e7o","year":"2002","unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Iterated Local Search. In: Glover, F.W., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol.\u00a057, pp. 321\u2013353. Springer, Heidelberg (2002)"},{"key":"24_CR10","unstructured":"Moscato, P.: On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Caltech Concurrent Computation Program, C3P Report 826, California Institute of Technology, Pasadena, USA (1989)"},{"issue":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/956993.956995","volume":"33","author":"B. Chun","year":"2003","unstructured":"Chun, B., Culler, D., Roscoe, T., Bavier, A., Peterson, L., Wawrzoniak, M., Bowman, M.: PlanetLab: An Overlay Testbed for Broad-Coverage Services. ACM SIGCOMM Computer Communication Review\u00a033(3), 3\u201312 (2003)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-540-24668-8_8","volume-title":"Passive and Active Network Measurement","author":"S. Banerjee","year":"2004","unstructured":"Banerjee, S., Griffin, T.G., Pias, M.: The Interdomain Connectivity of PlanetLab Nodes. In: Barakat, C., Pratt, I. (eds.) PAM 2004. LNCS, vol.\u00a03015, pp. 73\u201382. Springer, Heidelberg (2004)"},{"key":"24_CR13","unstructured":"Stribling, J.: PlanetLab All-Pairs-Pings (2003\u20132005), \n                  \n                    http:\/\/pdos.csail.mit.edu\/~strib\/pl_app\/"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12139-5_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:03:35Z","timestamp":1619784215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12139-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121388","9783642121395"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12139-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}