{"id":"https://openalex.org/W2989607837","doi":"https://doi.org/10.1007/978-3-030-29414-4_4","title":"Parameterized Complexity Analysis of Randomized Search Heuristics","display_name":"Parameterized Complexity Analysis of Randomized Search Heuristics","publication_year":2019,"publication_date":"2019-11-20","ids":{"openalex":"https://openalex.org/W2989607837","doi":"https://doi.org/10.1007/978-3-030-29414-4_4","mag":"2989607837"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-29414-4_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-29414-4_4","pdf_url":null,"source":{"id":"https://openalex.org/S4210186097","display_name":"Natural computing series","issn_l":"1619-7127","issn":["1619-7127","2627-6461"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Natural Computing Series","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2001.05120","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Optimisation and Logistics Group, School of Computer Science, The University of Adelaide, Adelaide, Australia","School of Computer Science, The University of Adelaide, Adelaide, SA, Australia"],"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics Group, School of Computer Science, The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"School of Computer Science, The University of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004695687","display_name":"Andrew M. Sutton","orcid":"https://orcid.org/0000-0003-1295-6715"},"institutions":[{"id":"https://openalex.org/I4210115145","display_name":"University of Minnesota, Duluth","ror":"https://ror.org/01hy4qx27","country_code":"US","type":"education","lineage":["https://openalex.org/I4210115145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew M. Sutton","raw_affiliation_strings":["Department of Computer Science, University of Minnesota Duluth, Duluth, MN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Minnesota Duluth, Duluth, MN, USA","institution_ids":["https://openalex.org/I4210115145"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089531887"],"corresponding_institution_ids":["https://openalex.org/I5681781"],"apc_list":null,"apc_paid":null,"fwci":1.6321,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85717322,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"213","last_page":"248"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8753998279571533},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8299065232276917},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.71070396900177},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.49354302883148193},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46511533856391907},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44952666759490967},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.441805899143219},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4390353262424469},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4385264217853546},{"id":"https://openalex.org/keywords/combinatorial-search","display_name":"Combinatorial search","score":0.41276732087135315},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.320620596408844},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3173869848251343},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2784602642059326},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.1310025155544281}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8753998279571533},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8299065232276917},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.71070396900177},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.49354302883148193},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46511533856391907},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44952666759490967},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.441805899143219},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4390353262424469},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4385264217853546},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.41276732087135315},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.320620596408844},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3173869848251343},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2784602642059326},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.1310025155544281}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-030-29414-4_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-29414-4_4","pdf_url":null,"source":{"id":"https://openalex.org/S4210186097","display_name":"Natural computing series","issn_l":"1619-7127","issn":["1619-7127","2627-6461"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Natural Computing Series","raw_type":"book-chapter"},{"id":"pmh:oai:arXiv.org:2001.05120","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.05120","pdf_url":"https://arxiv.org/pdf/2001.05120","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/132164","is_oa":false,"landing_page_url":"https://hdl.handle.net/2440/132164","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://link.springer.com/book/10.1007/978-3-030-29414-4","raw_type":"Book chapter"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2001.05120","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.05120","pdf_url":"https://arxiv.org/pdf/2001.05120","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W45588701","https://openalex.org/W372717656","https://openalex.org/W1541087579","https://openalex.org/W1552810675","https://openalex.org/W1570425181","https://openalex.org/W1631204983","https://openalex.org/W1981898306","https://openalex.org/W1985123706","https://openalex.org/W1986602966","https://openalex.org/W1988607827","https://openalex.org/W1998735557","https://openalex.org/W1999032440","https://openalex.org/W2011559870","https://openalex.org/W2013415302","https://openalex.org/W2025299767","https://openalex.org/W2026338082","https://openalex.org/W2072008504","https://openalex.org/W2079241742","https://openalex.org/W2079247611","https://openalex.org/W2079868147","https://openalex.org/W2082187727","https://openalex.org/W2086054344","https://openalex.org/W2088415500","https://openalex.org/W2090795732","https://openalex.org/W2109039359","https://openalex.org/W2110786553","https://openalex.org/W2111090561","https://openalex.org/W2113437680","https://openalex.org/W2120043459","https://openalex.org/W2151612665","https://openalex.org/W2153401898","https://openalex.org/W2157622572","https://openalex.org/W2165142526","https://openalex.org/W2165666764","https://openalex.org/W2323986888","https://openalex.org/W2441717076","https://openalex.org/W2486813313","https://openalex.org/W2518578858","https://openalex.org/W2883231721","https://openalex.org/W2951482518","https://openalex.org/W2962958080","https://openalex.org/W2963098446","https://openalex.org/W2998640234","https://openalex.org/W3022817735","https://openalex.org/W3122779104","https://openalex.org/W4213327093","https://openalex.org/W4234274482","https://openalex.org/W4236296313","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2400752627","https://openalex.org/W2767174160","https://openalex.org/W2950838401","https://openalex.org/W4297689169","https://openalex.org/W2295534309","https://openalex.org/W2953291322","https://openalex.org/W4296116869","https://openalex.org/W4286853492","https://openalex.org/W3215145351","https://openalex.org/W2152809035"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}