{"id":"https://openalex.org/W2088188524","doi":"https://doi.org/10.1137/0211045","title":"Approximation Algorithms for the Set Covering and Vertex Cover Problems","display_name":"Approximation Algorithms for the Set Covering and Vertex Cover Problems","publication_year":1982,"publication_date":"1982-08-01","ids":{"openalex":"https://openalex.org/W2088188524","doi":"https://doi.org/10.1137/0211045","mag":"2088188524"},"language":"en","primary_location":{"id":"doi:10.1137/0211045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211045","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5085640376","display_name":"Dorit S. Hochbaum","orcid":"https://orcid.org/0000-0002-2498-0512"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dorit S. Hochbaum","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085640376"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7474,"has_fulltext":false,"cited_by_count":505,"citation_normalized_percentile":{"value":0.9142198,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"11","issue":"3","first_page":"555","last_page":"556"},"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.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9983000159263611,"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/set-cover-problem","display_name":"Set cover problem","score":0.8472082614898682},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7388832569122314},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5811377763748169},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5715652704238892},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.5667757391929626},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5457992553710938},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5287109017372131},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5261045098304749},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5233979821205139},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5057854652404785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4780757427215576},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.427846759557724},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4218376576900482},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4185565114021301},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35688695311546326},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35090214014053345},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.137843519449234},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07105734944343567},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06918397545814514}],"concepts":[{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.8472082614898682},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7388832569122314},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5811377763748169},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5715652704238892},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.5667757391929626},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5457992553710938},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5287109017372131},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5261045098304749},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5233979821205139},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5057854652404785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4780757427215576},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.427846759557724},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4218376576900482},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4185565114021301},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35688695311546326},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35090214014053345},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.137843519449234},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07105734944343567},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06918397545814514},{"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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0211045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211045","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2013415302","https://openalex.org/W2040924621","https://openalex.org/W2141038472","https://openalex.org/W2157054705","https://openalex.org/W2401610261","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W4247100793","https://openalex.org/W2108073487","https://openalex.org/W2112112676","https://openalex.org/W2079730540","https://openalex.org/W2551034790","https://openalex.org/W2156896570","https://openalex.org/W1566660502","https://openalex.org/W1966805076","https://openalex.org/W2077783414","https://openalex.org/W1903530166"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,10],"heuristic":[3],"that":[4],"delivers":[5],"in":[6],"$O(n^3":[7],")$":[8],"steps":[9],"solution":[11],"for":[12],"the":[13,17,24,33],"set":[14],"covering":[15,29],"problem":[16],"value":[18],"of":[19,27],"which":[20],"does":[21],"not":[22],"exceed":[23],"maximum":[25],"number":[26],"sets":[28],"an":[30],"element":[31],"times":[32],"optimal":[34],"value.":[35]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":17},{"year":2024,"cited_by_count":22},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":18},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":28},{"year":2017,"cited_by_count":17},{"year":2016,"cited_by_count":22},{"year":2015,"cited_by_count":20},{"year":2014,"cited_by_count":24},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":13}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}