{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:17:30Z","timestamp":1763727450179,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030125974"},{"type":"electronic","value":"9783030125981"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-12598-1_40","type":"book-chapter","created":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T14:41:50Z","timestamp":1549118510000},"page":"504-515","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Runtime Analysis of Evolutionary Multi-objective Algorithms Optimising the Degree and Diameter of Spanning Trees"],"prefix":"10.1007","author":[{"given":"Wanru","family":"Gao","sequence":"first","affiliation":[]},{"given":"Mojgan","family":"Pourhassan","sequence":"additional","affiliation":[]},{"given":"Vahid","family":"Roostapour","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,3]]},"reference":[{"key":"40_CR1","doi-asserted-by":"publisher","unstructured":"Abuali, F.N., Schoenefeld, D.A., Wainwright, R.L.: Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees. In: Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994, pp. 242\u2013246. ACM, New York (1994). https:\/\/doi.org\/10.1145\/326619.326733","DOI":"10.1145\/326619.326733"},{"key":"40_CR2","doi-asserted-by":"publisher","unstructured":"Bui, T.N., Zrncic, C.M.: An ant-based algorithm for finding degree-constrained minimum spanning tree. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, GECCO 2006, pp. 11\u201318. ACM, New York (2006). https:\/\/doi.org\/10.1145\/1143997.1144000","DOI":"10.1145\/1143997.1144000"},{"issue":"1","key":"40_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-006-9003-1","volume":"13","author":"N Chaiyaratana","year":"2007","unstructured":"Chaiyaratana, N., Piroonratana, T., Sangkawelert, N.: Effects of diversity control in single-objective and multi-objective genetic algorithms. J. Heuristics 13(1), 1\u201334 (2007)","journal-title":"J. Heuristics"},{"key":"40_CR4","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"issue":"4","key":"40_CR5","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2014). https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"40_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"40_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10852-012-9182-8","volume":"11","author":"A Dekker","year":"2012","unstructured":"Dekker, A., P\u00e9rez-Ros\u00e9s, H., Pineda-Villavicencio, G., Watters, P.: The maximum degree & diameter-bounded subgraph and its applications. J. Math. Model. Algorithms 11(3), 249\u2013268 (2012). https:\/\/doi.org\/10.1007\/s10852-012-9182-8","journal-title":"J. Math. Model. Algorithms"},{"key":"40_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1007\/978-3-319-45823-6_81","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"W Gao","year":"2016","unstructured":"Gao, W., Nallaperuma, S., Neumann, F.: Feature-based diversity optimization for problem instance classification. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 869\u2013879. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_81"},{"key":"40_CR9","doi-asserted-by":"publisher","unstructured":"Gao, W., Neumann, F.: Runtime analysis for maximizing population diversity in single-objective optimization. In: Genetic and Evolutionary Computation Conference, GECCO 2014, Vancouver, BC, Canada, 12\u201316 July 2014, pp. 777\u2013784 (2014). https:\/\/doi.org\/10.1145\/2576768.2598251","DOI":"10.1145\/2576768.2598251"},{"key":"40_CR10","doi-asserted-by":"publisher","unstructured":"Giel, O.: Expected runtimes of a simple multi-objective evolutionary algorithm. In: The 2003 Congress on Evolutionary Computation 2003, CEC 2003, vol. 3, pp. 1918\u20131925, December 2003. https:\/\/doi.org\/10.1109\/CEC.2003.1299908","DOI":"10.1109\/CEC.2003.1299908"},{"issue":"3","key":"40_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/net.10069","volume":"41","author":"Luis Gouveia","year":"2003","unstructured":"Gouveia, L., Magnanti, T.L.: Network flow models for designing diameter-constrained minimum-spanning and steiner trees. Networks 41(3), 159\u2013173. https:\/\/doi.org\/10.1002\/net.10069","journal-title":"Networks"},{"issue":"1","key":"40_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/TPDS.2008.57","volume":"20","author":"M Khan","year":"2009","unstructured":"Khan, M., Pandurangan, G., Kumar, V.S.A.: Distributed algorithms for constructing approximate minimum spanning trees in wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 20(1), 124\u2013139 (2009). https:\/\/doi.org\/10.1109\/TPDS.2008.57","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"40_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00453-004-1121-2","volume":"41","author":"J K\u00f6nemann","year":"2005","unstructured":"K\u00f6nemann, J., Levin, A., Sinha, A.: Approximating the degree-bounded minimum diameter spanning tree problem. Algorithmica 41(2), 117\u2013129 (2005). https:\/\/doi.org\/10.1007\/s00453-004-1121-2","journal-title":"Algorithmica"},{"key":"40_CR14","doi-asserted-by":"publisher","unstructured":"Neumann, A., Gao, W., Doerr, C., Neumann, F., Wagner, M.: Discrepancy-based evolutionary diversity optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, 15\u201319 July 2018, pp. 991\u2013998 (2018). https:\/\/doi.org\/10.1145\/3205455.3205532","DOI":"10.1145\/3205455.3205532"},{"key":"40_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02570700","volume":"14","author":"G Robins","year":"1999","unstructured":"Robins, G., Salowe, J.S.: Low-degree minimum spanning trees. Discrete Comput. Geom. 14, 151\u2013165 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"40_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/3-540-45712-7_45","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN VII","author":"RK Ursem","year":"2002","unstructured":"Ursem, R.K.: Diversity-guided evolutionary algorithms. In: Guerv\u00f3s, J.J.M., Adamidis, P., Beyer, H.-G., Schwefel, H.-P., Fern\u00e1ndez-Villaca\u00f1as, J.-L. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 462\u2013471. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45712-7_45"},{"issue":"6","key":"40_CR17","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007). https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans. Evol. Comput."},{"key":"40_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-17144-4_1","volume-title":"Metaheuristics for Multiobjective Optimisation","author":"E Zitzler","year":"2004","unstructured":"Zitzler, E., Laumanns, M., Bleuler, S.: A tutorial on evolutionary multiobjective optimization. In: Gandibleux, X., Sevaux, M., S\u00f6rensen, K., T\u2019kindt, V. (eds.) Metaheuristics for Multiobjective Optimisation, vol. 535, pp. 3\u201337. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-642-17144-4_1"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-12598-1_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:26:02Z","timestamp":1710264362000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-12598-1_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030125974","9783030125981"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-12598-1_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EMO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Evolutionary Multi-Criterion Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"East Lansing, MI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"emo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.emo2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}