{"id":"https://openalex.org/W2016700350","doi":"https://doi.org/10.1145/1143997.1144095","title":"Maximum cardinality matchings on trees by randomized local search","display_name":"Maximum cardinality matchings on trees by randomized local search","publication_year":2006,"publication_date":"2006-07-08","ids":{"openalex":"https://openalex.org/W2016700350","doi":"https://doi.org/10.1145/1143997.1144095","mag":"2016700350"},"language":"en","primary_location":{"id":"doi:10.1145/1143997.1144095","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144095","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033114072","display_name":"Oliver Giel","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Oliver Giel","raw_affiliation_strings":["Universit\u00e4t Dortmund, Dortmund, Germany","[Universitat Dortmund, Dortmund, Germany]"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"[Universitat Dortmund, Dortmund, Germany]","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075262791","display_name":"Ingo Wegener","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ingo Wegener","raw_affiliation_strings":["Universit\u00e4t Dortmund, Dortmund, Germany","[Universitat Dortmund, Dortmund, Germany]"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"[Universitat Dortmund, Dortmund, Germany]","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033114072"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":2.716,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.90834863,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"539","last_page":"546"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7457645535469055},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6566146016120911},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6365092992782593},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5514526963233948},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48548200726509094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4761773943901062},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.47578179836273193},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.46390101313591003},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.4533795416355133},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43892210721969604},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42553460597991943},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42317911982536316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3484365940093994},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33091679215431213},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32730013132095337},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.10046440362930298}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7457645535469055},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6566146016120911},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6365092992782593},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5514526963233948},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48548200726509094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4761773943901062},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.47578179836273193},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.46390101313591003},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4533795416355133},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43892210721969604},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42553460597991943},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42317911982536316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3484365940093994},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33091679215431213},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32730013132095337},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10046440362930298},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1143997.1144095","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144095","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1499313444","https://openalex.org/W1510977876","https://openalex.org/W1522890465","https://openalex.org/W1554385073","https://openalex.org/W1573730023","https://openalex.org/W1581232621","https://openalex.org/W1636202028","https://openalex.org/W1985318592","https://openalex.org/W1995260977","https://openalex.org/W2003813631","https://openalex.org/W2010601719","https://openalex.org/W2024281442","https://openalex.org/W2048652909","https://openalex.org/W2059608229","https://openalex.org/W2065295938","https://openalex.org/W2090726598","https://openalex.org/W2157529519","https://openalex.org/W6665293600"],"related_works":["https://openalex.org/W2027038333","https://openalex.org/W2303442355","https://openalex.org/W2617588076","https://openalex.org/W2112825959","https://openalex.org/W2338021483","https://openalex.org/W1884558822","https://openalex.org/W2517040716","https://openalex.org/W2150695606","https://openalex.org/W2067948003","https://openalex.org/W2156087782"],"abstract_inverted_index":{"To":[0],"understand":[1],"the":[2,75,78],"working":[3],"principles":[4],"of":[5],"randomized":[6,69,82,111],"search":[7,70,84,113],"heuristics":[8,71],"like":[9,72],"evolutionary":[10],"algorithms":[11],"they":[12,97],"are":[13,94],"analyzed":[14],"on":[15,128],"optimization":[16,34,38],"problems":[17,39],"whose":[18,117],"structure":[19,118],"is":[20,24,29,47,66,119],"well-studied.":[21],"The":[22,43],"idea":[23],"to":[25,31,99],"investigate":[26],"when":[27],"it":[28],"possible":[30],"simulate":[32],"clever":[33],"techniques":[35],"for":[36,50,89,115],"combinatorial":[37],"by":[40,62],"random":[41],"search.":[42],"maximum":[44,87,101,126],"matching":[45],"problem":[46],"well":[48],"suited":[49],"this":[51,107],"approach":[52],"since":[53],"long":[54],"augmenting":[55],"paths":[56],"do":[57],"not":[58],"allow":[59],"immediate":[60],"improvements":[61],"local":[63,83,112],"changes.":[64],"It":[65],"known":[67],"that":[68,123],"simulated":[73],"annealing,":[74],"Metropolis":[76],"algorithm,":[77],"(1+1)":[79],"EA":[80],"and":[81],"efficiently":[85],"approximate":[86],"matchings":[88,102,127],"any":[90],"graph;":[91],"however,":[92],"there":[93],"graphs":[95,116],"where":[96],"fail":[98],"find":[100],"in":[103,130],"polynomial":[104,132],"time.":[105,133],"In":[106],"paper,":[108],"we":[109],"examine":[110],"(RLS)":[114],"simple.":[120],"We":[121],"show":[122],"RLS":[124],"finds":[125],"trees":[129],"expected":[131]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}