{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T14:55:49Z","timestamp":1786978549046,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540389903","type":"print"},{"value":"9783540389910","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11844297_28","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T14:55:37Z","timestamp":1160060137000},"page":"272-281","source":"Crossref","is-referenced-by-count":12,"title":["Evolutionary Local Search for Designing Peer-to-Peer Overlay Topologies Based on Minimum Routing Cost Spanning Trees"],"prefix":"10.1007","author":[{"given":"Peter","family":"Merz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steffen","family":"Wolf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Gnutella: Gnutella Protocol v. 0.4 (2000), \nhttp:\/\/www.clip2.com\/"},{"key":"28_CR2","unstructured":"Ripeanu, M., Iamnitchi, A., Foster, I.: Mapping the Gnutella Network. IEEE Internet Computing (2002)"},{"key":"28_CR3","unstructured":"Cohen, B.: Incentives Build Robustness in BitTorrent. In: Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA, USA (2003)"},{"key":"28_CR4","unstructured":"Chakravarti, A.J., Baumgartner, G., Lauria, M.: The Organic Grid: Self-Organizing Computation on a Peer-to-Peer Network. In: Proceedings of the International Conference on Autonomic Computing (ICAC 2004), New York, NY (2004)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Merz, P., Gorunova, K.: Efficient Broadcast in P2P Grids. In: Proceedings of the IEEE\/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2005), Cardiff, UK (2005)","DOI":"10.1109\/CCGRID.2005.1558560"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Kubiatowicz, J., et al.: OceanStore: An Architecture for Global-Scale Persistent Storage. In: Proc. of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), pp. 190\u2013201 (2000)","DOI":"10.1145\/378993.379239"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Demers, A.J., Greene, D.H., Hauser, C., Irish, W., Larson, J.: Epidemic algorithms for replicated database maintenance. In: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"28_CR8","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., Kan, A.H.G.R.: The Complexity of the Network Design Problem. Networks\u00a08, 279\u2013285 (1978)","journal-title":"Networks"},{"key":"28_CR9","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 on Computing\u00a029, 761\u2013778 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0166-218X(99)00212-7","volume":"102","author":"B.Y. Wu","year":"2000","unstructured":"Wu, B.Y., Chao, K.M., Tang, C.Y.: Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. Discrete Applied Mathematics\u00a0102, 245\u2013266 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R.E. Bellman","year":"1958","unstructured":"Bellman, R.E.: On a Routing Problem. Quart. of Appl. Mathem.\u00a016, 87\u201390 (1958)","journal-title":"Quart. of Appl. Mathem."},{"key":"28_CR13","volume-title":"Flows in Networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton Univ. Press, Princeton (1962)"},{"key":"28_CR14","unstructured":"Sobeih, A., Wang, J., Yurcik, W.: Performance Evaluation and Comparison of Tree and Ring Application-Layer Multicast Overlay Networks. In: Proceedings of the 1st International Computer Engineering Conference: New Technologies for the Information Society (ICENCO), Cairo, Egypt (2004)"},{"key":"28_CR15","first-page":"563","volume-title":"GECCO 2005: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation","author":"K.A. Lehmann","year":"2005","unstructured":"Lehmann, K.A., Kaufmann, M.: Evolutionary Algorithms for the Self-Organized Evolution of Networks. In: Beyer, H.-G., et al. (eds.) GECCO 2005: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, Washington DC, USA, vol.\u00a01, pp. 563\u2013570. ACM Press, New York (2005)"},{"key":"28_CR16","unstructured":"Brosh, E., Shavitt, Y.: Approximation and Heuristic Algorithms for Minimum-Delay Application Layer Multicast Trees. In: The 23rd International Conference on Computer Copmunications, IEEE INFOCOM, Hong Kong (2004)"},{"key":"28_CR17","unstructured":"Tan, S.W., Waters, A., Crawford, J.: MeshTree: A Delay optimised Overlay Multicast Tree Building Protocol. Tech. R. 5-05, Univ. of Kent, Canterbury, UK (2005)"},{"key":"28_CR18","volume-title":"Handb. of Metaheuristics","author":"H.R. Lourenco","year":"2003","unstructured":"Lourenco, H.R., Martin, O., St\u00fctzle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G. (eds.) Handb. of Metaheuristics, Kluwer Acad. Publ., Dordrecht (2003)"},{"key":"28_CR19","unstructured":"Moscato, P.: On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Technical Report C3P Report 826, Caltech Concurrent Computation Program, California Institue of Technology (1989)"},{"key":"28_CR20","first-page":"297","volume":"13","author":"P. Merz","year":"2001","unstructured":"Merz, P., Freisleben, B.: Memetic Algorithms for the Traveling Salesman Problem. Complex Systems\u00a013, 297\u2013345 (2001)","journal-title":"Complex Systems"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Pias, M.: The Interdomain Connectivity of PlanetLab Nodes. In: Barakat, C., Pratt, I. (eds.) PAM 2004. LNCS, vol.\u00a03015, Springer, Heidelberg (2004)"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P. Merz","year":"2000","unstructured":"Merz, P., Freisleben, B.: Fitness Landscape Analysis and Memetic Algorithms for the Quadratic Assignment Problem. IEEE Transactions on Evolutionary Computation\u00a04, 337\u2013352 (2000)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"28_CR23","first-page":"303","volume":"12","author":"P. Merz","year":"2004","unstructured":"Merz, P.: Advanced Fitness Landscape Analysis and the Performance of Memetic Algorithms. Evolutionary Computation, Special Issue on Memetic Evolutionary Algorithms\u00a012, 303\u2013326 (2004)","journal-title":"Evolutionary Computation, Special Issue on Memetic Evolutionary Algorithms"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN IX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/11844297_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T21:09:12Z","timestamp":1664226552000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/11844297_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540389903","9783540389910"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11844297_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}