{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:39:02Z","timestamp":1742956742287,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581145"},{"type":"electronic","value":"9783030581152"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58115-2_48","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:02:51Z","timestamp":1598997771000},"page":"686-698","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Speed-Up by Quadratization on LeadingOnes"],"prefix":"10.1007","author":[{"given":"Andrew M.","family":"Sutton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"48_CR1","unstructured":"Boros, E., Gruber, A.: On quadratization of pseudo-Boolean functions. In: International Symposium on Artificial Intelligence and Mathematics (2012)"},{"issue":"1\u20133","key":"48_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Appl. Math. 123(1\u20133), 155\u2013225 (2002)","journal-title":"Discrete Appl. Math."},{"key":"48_CR3","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-29414-4_1","volume-title":"Theory of Evolutionary Computation","author":"B Doerr","year":"2020","unstructured":"Doerr, B.: Probabilistic tools for the analysis of randomized optimization heuristics. Theory of Evolutionary Computation. NCS, pp. 1\u201387. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_1"},{"key":"48_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0056845","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN V","author":"S Droste","year":"1998","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the optimization of unimodal functions with the (1+1) evolutionary algorithm. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 13\u201322. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056845"},{"issue":"1\u20132","key":"48_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276(1\u20132), 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"Freedman, D., Drineas, P.: Energy minimization via graph cuts: settling what is possible. In: Computer Society Conference on Computer Vision and Pattern Recognition, pp. 939\u2013946. IEEE Computer Society (2005)","DOI":"10.1109\/CVPR.2005.143"},{"key":"48_CR7","unstructured":"Rana, S., Heckendorn, R.B., Whitley, D.: A tractable Walsh analysis of SAT and its implications for genetic algorithms. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI 98), pp. 392\u2013397 (1998)"},{"key":"48_CR8","unstructured":"Rudolph, G.: Convergence properties of evolutionary algorithms. Kovac (1997)"},{"issue":"1","key":"48_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01165154","volume":"20","author":"PF Stadler","year":"1996","unstructured":"Stadler, P.F.: Landscapes and their correlation functions. J. Math. Chem. 20(1), 1\u201345 (1996). https:\/\/doi.org\/10.1007\/BF01165154","journal-title":"J. Math. Chem."},{"issue":"4","key":"48_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0375-9601(92)90557-3","volume":"161","author":"PF Stadler","year":"1992","unstructured":"Stadler, P.F., Schnabl, W.: The landscape of the traveling salesman problem. Phys. Lett. A 161(4), 337\u2013344 (1992)","journal-title":"Phys. Lett. A"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Sutton, A.M., Darrell Whitley, L., Howe, A.E.: A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2009), pp. 365\u2013372. ACM (2009)","DOI":"10.1145\/1569901.1569952"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58115-2_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T00:45:58Z","timestamp":1723509958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-2_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","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":"268","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":"99","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":"37% - 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","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":"2.2","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)"}}]}}