{"id":"https://openalex.org/W1559942958","doi":"https://doi.org/10.1007/978-3-642-02017-9_43","title":"Greedy Local Search and Vertex Cover in Sparse Random Graphs","display_name":"Greedy Local Search and Vertex Cover in Sparse Random Graphs","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1559942958","doi":"https://doi.org/10.1007/978-3-642-02017-9_43","mag":"1559942958"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-02017-9_43","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02017-9_43","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":"conference-paper","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/A5038689623","display_name":"Carsten Witt","orcid":"https://orcid.org/0000-0002-6105-7700"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Carsten Witt","raw_affiliation_strings":["DTU Informatics, Technical University of Denmark, 2800 Kgs., Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DTU Informatics, Technical University of Denmark, 2800 Kgs., Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038689623"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"410","last_page":"419"},"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.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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.9983999729156494,"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.7166953682899475},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7125438451766968},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5410043597221375},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5308229327201843},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.519747257232666},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.49666672945022583},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49490684270858765},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.47743067145347595},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.46907442808151245},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4423920512199402},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.41591835021972656},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41164708137512207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3768237829208374},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.335304319858551},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3257012963294983},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3231247365474701},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2997371554374695},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2940613329410553}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7166953682899475},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7125438451766968},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5410043597221375},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5308229327201843},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.519747257232666},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.49666672945022583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49490684270858765},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47743067145347595},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.46907442808151245},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4423920512199402},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.41591835021972656},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41164708137512207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3768237829208374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.335304319858551},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3257012963294983},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3231247365474701},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2997371554374695},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2940613329410553},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-02017-9_43","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02017-9_43","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"},{"id":"pmh:oai:pure.atira.dk:publications/d63e4965-08fd-4f7a-8425-ad474b7241e5","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/d63e4965-08fd-4f7a-8425-ad474b7241e5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Witt , C 2009 , Greedy Local Search and Vertex Cover in Sparse Random Graphs . in Theory and Applications of Models of Computation : 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings . Springer , Lecture Notes in Computer Science , vol. 5532 , pp. 410-419 , 6th Annual Conference on Theory and Applications of Models of Computation (TAMC 2009) , Changsha , China , 18/05/2009 . https://doi.org/10.1007/978-3-642-02017-9_43","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W191748401","https://openalex.org/W390146837","https://openalex.org/W1510977876","https://openalex.org/W1522890465","https://openalex.org/W1533148775","https://openalex.org/W1581232621","https://openalex.org/W1581948821","https://openalex.org/W1589421353","https://openalex.org/W1683192234","https://openalex.org/W1967020821","https://openalex.org/W1990525562","https://openalex.org/W1993433103","https://openalex.org/W2011904305","https://openalex.org/W2017458202","https://openalex.org/W2083116175","https://openalex.org/W2097844290","https://openalex.org/W2105792062","https://openalex.org/W2153401898","https://openalex.org/W2157816158","https://openalex.org/W2162189348","https://openalex.org/W2497930546","https://openalex.org/W2614370452","https://openalex.org/W2751862591","https://openalex.org/W2905110430","https://openalex.org/W2946046356","https://openalex.org/W2963332076","https://openalex.org/W3145128584","https://openalex.org/W4247023489","https://openalex.org/W4285719527","https://openalex.org/W4301441647"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2778153218","https://openalex.org/W1531601525","https://openalex.org/W2383239740","https://openalex.org/W2163115662","https://openalex.org/W2038777942","https://openalex.org/W2518578858","https://openalex.org/W4382935776"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}