{"id":"https://openalex.org/W1585379182","doi":"https://doi.org/10.1007/978-3-642-30850-5_14","title":"A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs","display_name":"A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1585379182","doi":"https://doi.org/10.1007/978-3-642-30850-5_14","mag":"1585379182"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-30850-5_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-30850-5_14","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5067257613","display_name":"Martin Dietzfelbinger","orcid":"https://orcid.org/0000-0001-5484-3474"},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Dietzfelbinger","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Informatik und Automatisierung, Technische Universit\u00e4t Ilmenau, Germany","Fakult\u00e4t f\u00fcr Informatik und Automatisierung, Technische Universit\u00e4t, Ilmenau, Germany"],"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik und Automatisierung, Technische Universit\u00e4t Ilmenau, Germany","institution_ids":["https://openalex.org/I119449181"]},{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik und Automatisierung, Technische Universit\u00e4t, Ilmenau, Germany","institution_ids":["https://openalex.org/I119449181"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070863095","display_name":"Hendrik Peilke","orcid":null},"institutions":[{"id":"https://openalex.org/I2799609405","display_name":"Gesundes Kinzigtal (Germany)","ror":"https://ror.org/048knfw55","country_code":"DE","type":"company","lineage":["https://openalex.org/I2799609405"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hendrik Peilke","raw_affiliation_strings":["IBYKUS AG f\u00fcr Informationstechnologie, Erfurt, Germany","IBYKUS AG f\u00fcr Informationstechnologie, Erfurt, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"IBYKUS AG f\u00fcr Informationstechnologie, Erfurt, Germany","institution_ids":["https://openalex.org/I2799609405"]},{"raw_affiliation_string":"IBYKUS AG f\u00fcr Informationstechnologie, Erfurt, Germany#TAB#","institution_ids":["https://openalex.org/I2799609405"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065587363","display_name":"Michael Rink","orcid":null},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Rink","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Informatik und Automatisierung, Technische Universit\u00e4t Ilmenau, Germany","Fakult\u00e4t f\u00fcr Informatik und Automatisierung, Technische Universit\u00e4t, Ilmenau, Germany"],"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik und Automatisierung, Technische Universit\u00e4t Ilmenau, Germany","institution_ids":["https://openalex.org/I119449181"]},{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik und Automatisierung, Technische Universit\u00e4t, Ilmenau, Germany","institution_ids":["https://openalex.org/I119449181"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067257613"],"corresponding_institution_ids":["https://openalex.org/I119449181"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7726,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.69807322,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"148","last_page":"159"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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.9994000196456909,"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.9972000122070312,"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/heuristics","display_name":"Heuristics","score":0.8108341693878174},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7589288949966431},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7179727554321289},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6629524827003479},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5796797275543213},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5591144561767578},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.5072960257530212},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4837770164012909},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.46433746814727783},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45651909708976746},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.45023757219314575},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4471467137336731},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4459107518196106},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4350959360599518},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3506656289100647},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25638699531555176},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17446684837341309},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.13427257537841797},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08717206120491028},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08016395568847656},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.0648438036441803}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8108341693878174},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7589288949966431},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7179727554321289},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6629524827003479},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5796797275543213},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5591144561767578},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.5072960257530212},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4837770164012909},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.46433746814727783},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45651909708976746},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.45023757219314575},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4471467137336731},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4459107518196106},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4350959360599518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3506656289100647},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25638699531555176},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17446684837341309},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.13427257537841797},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08717206120491028},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08016395568847656},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0648438036441803},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-30850-5_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-30850-5_14","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W191748401","https://openalex.org/W1494735819","https://openalex.org/W1499313444","https://openalex.org/W1513400187","https://openalex.org/W1528625750","https://openalex.org/W1585379182","https://openalex.org/W1602850114","https://openalex.org/W1979740015","https://openalex.org/W1987102081","https://openalex.org/W2001426250","https://openalex.org/W2003813631","https://openalex.org/W2016635557","https://openalex.org/W2017458202","https://openalex.org/W2059608229","https://openalex.org/W2063911102","https://openalex.org/W2083116175","https://openalex.org/W2144797269","https://openalex.org/W2157529519","https://openalex.org/W2163768829","https://openalex.org/W2169485677","https://openalex.org/W2950799618","https://openalex.org/W4233756358","https://openalex.org/W4247023489"],"related_works":["https://openalex.org/W2277088917","https://openalex.org/W4280543056","https://openalex.org/W2154172459","https://openalex.org/W2541760731","https://openalex.org/W2018096104","https://openalex.org/W1827895227","https://openalex.org/W2373750984","https://openalex.org/W45904909","https://openalex.org/W1986806918","https://openalex.org/W1585379182"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}