{"id":"https://openalex.org/W1587123489","doi":"https://doi.org/10.4086/toc.2006.v002a002","title":"","display_name":"","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1587123489","doi":"https://doi.org/10.4086/toc.2006.v002a002","mag":"1587123489"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2006.v002a002","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2006.v002a002","pdf_url":"http://www.theoryofcomputing.org/articles/v002a002/v002a002.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.theoryofcomputing.org/articles/v002a002/v002a002.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103334936","display_name":"Sanjeev Arora","orcid":"https://orcid.org/0000-0002-8636-9970"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sanjeev Arora","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109915650","display_name":"B\u00e9la Bollob\u00e1s","orcid":"https://orcid.org/0000-0002-9819-7213"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bela Bollobas","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067889485","display_name":"L\u00e1szl\u00f3 Lov\u00e1sz","orcid":"https://orcid.org/0000-0002-6242-5894"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laszlo Lovasz","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5074107236","display_name":"Iannis Tourlakis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Iannis Tourlakis","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103334936"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.1006,"has_fulltext":true,"cited_by_count":101,"citation_normalized_percentile":{"value":0.9835551,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"2","issue":"1","first_page":"19","last_page":"51"},"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.9934999942779541,"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.9934999942779541,"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/T10237","display_name":"Cryptography and Data Security","score":0.9840999841690063,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9544000029563904,"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/vertex-cover","display_name":"Vertex cover","score":0.7077993154525757},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5651264786720276},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48815733194351196},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4602791965007782},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4534953534603119},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.422555148601532},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.41640007495880127},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40424585342407227},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33644455671310425},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.29343435168266296},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.27999651432037354},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20014241337776184}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7077993154525757},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5651264786720276},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48815733194351196},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4602791965007782},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4534953534603119},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.422555148601532},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.41640007495880127},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40424585342407227},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33644455671310425},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.29343435168266296},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27999651432037354},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20014241337776184},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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":1,"locations":[{"id":"doi:10.4086/toc.2006.v002a002","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2006.v002a002","pdf_url":"http://www.theoryofcomputing.org/articles/v002a002/v002a002.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2006.v002a002","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2006.v002a002","pdf_url":"http://www.theoryofcomputing.org/articles/v002a002/v002a002.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G276520894","display_name":null,"funder_award_id":"CCR-0205594","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3631313543","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320308943","funder_display_name":"Microsoft Research"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8886388375","display_name":"ITR:  New directions in clustering and learning","funder_award_id":"0205594","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1587123489.pdf","grobid_xml":"https://content.openalex.org/works/W1587123489.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W168093571","https://openalex.org/W1573558634","https://openalex.org/W1714357736","https://openalex.org/W1972894929","https://openalex.org/W1990313671","https://openalex.org/W1999032440","https://openalex.org/W2021659530","https://openalex.org/W2049143039","https://openalex.org/W2059154872","https://openalex.org/W2059222268","https://openalex.org/W2061987651","https://openalex.org/W2080905757","https://openalex.org/W2167508847","https://openalex.org/W2506642202"],"related_works":["https://openalex.org/W1566660502","https://openalex.org/W2156896570","https://openalex.org/W623607250","https://openalex.org/W2036594069","https://openalex.org/W4245429118","https://openalex.org/W41549461","https://openalex.org/W2168711306","https://openalex.org/W4245505501","https://openalex.org/W3111015064","https://openalex.org/W2389521946"],"abstract_inverted_index":{"Proving":[0],"integrality":[1,30],"gaps":[2],"for":[3,35,41],"linear":[4,39],"relaxations":[5,40],"of":[6,32,38],"NP":[7],"optimization":[8],"problems":[9,51],"is":[10],"a":[11,18,23],"difficult":[12],"task":[13],"and":[14,44],"usually":[15],"undertaken":[16],"on":[17],"case-by-case":[19],"basis.":[20],"We":[21,27],"initiate":[22],"more":[24],"systematic":[25],"approach.":[26],"prove":[28],"an":[29],"gap":[31],"2":[33],"-o(1)":[34],"three":[36],"families":[37],"VERTEX":[42],"COVER,":[43],"our":[45],"methods":[46],"seem":[47],"relevant":[48],"to":[49],"other":[50],"as":[52],"well.":[53]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2016-06-24T00:00:00"}