{"id":"https://openalex.org/W2146823188","doi":"https://doi.org/10.1109/sfcs.2002.1181954","title":"Proving integrality gaps without knowing the linear program","display_name":"Proving integrality gaps without knowing the linear program","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2146823188","doi":"https://doi.org/10.1109/sfcs.2002.1181954","mag":"2146823188"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1181954","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","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/A5103209777","display_name":"Sanjeev Arora","orcid":"https://orcid.org/0000-0003-4852-691X"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Arora","raw_affiliation_strings":["Princeton University, USA","Princeton Univ, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton Univ, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110896517","display_name":"B Bollob\u00e1s","orcid":null},"institutions":[{"id":"https://openalex.org/I2802207673","display_name":"Trinity College London","ror":"https://ror.org/02gcnpr25","country_code":"GB","type":"education","lineage":["https://openalex.org/I2802207673"]},{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I94658018","display_name":"University of Memphis","ror":"https://ror.org/01cq23130","country_code":"US","type":"education","lineage":["https://openalex.org/I94658018"]},{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"B. Bollobas","raw_affiliation_strings":["Microsoft Research Limited, Redmond, WA, USA","Microsoft Research, University of Memphis, Redmond, WA, USA","Trinity College Dublin, Cambridge, UK","Microsoft USA","University of Memphis","University of Cambridge"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research, University of Memphis, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I94658018"]},{"raw_affiliation_string":"Trinity College Dublin, Cambridge, UK","institution_ids":["https://openalex.org/I2802207673"]},{"raw_affiliation_string":"Microsoft USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"University of Memphis","institution_ids":["https://openalex.org/I94658018"]},{"raw_affiliation_string":"University of Cambridge","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067889485","display_name":"L\u00e1szl\u00f3 Lov\u00e1sz","orcid":"https://orcid.org/0000-0002-6242-5894"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU","US"],"is_corresponding":false,"raw_author_name":"L. Lovasz","raw_affiliation_strings":["Microsoft Research Limited, Redmond, WA, USA","E\u00f6tv\u00f6s L\u00f3r\u00e1nd Tudom\u00e1nyegyetem"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"E\u00f6tv\u00f6s L\u00f3r\u00e1nd Tudom\u00e1nyegyetem","institution_ids":["https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103209777"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":5.8151,"has_fulltext":false,"cited_by_count":82,"citation_normalized_percentile":{"value":0.9662364,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"313","last_page":"322"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9962999820709229,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9926999807357788,"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/vertex-cover","display_name":"Vertex cover","score":0.8006478548049927},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6673875451087952},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6602329015731812},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.571884036064148},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5333160161972046},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5310386419296265},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.4624410569667816},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.38117527961730957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3665042519569397},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34406089782714844},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31911081075668335},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2124641239643097},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09512534737586975}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8006478548049927},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6673875451087952},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6602329015731812},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.571884036064148},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5333160161972046},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5310386419296265},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.4624410569667816},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.38117527961730957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3665042519569397},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34406089782714844},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31911081075668335},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2124641239643097},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09512534737586975},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sfcs.2002.1181954","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","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":38,"referenced_works":["https://openalex.org/W168093571","https://openalex.org/W204341840","https://openalex.org/W1573558634","https://openalex.org/W1714357736","https://openalex.org/W1972894929","https://openalex.org/W1990313671","https://openalex.org/W1999032440","https://openalex.org/W2004308928","https://openalex.org/W2021659530","https://openalex.org/W2028146521","https://openalex.org/W2049143039","https://openalex.org/W2059154872","https://openalex.org/W2059222268","https://openalex.org/W2061987651","https://openalex.org/W2068871408","https://openalex.org/W2100440346","https://openalex.org/W2106264302","https://openalex.org/W2127813745","https://openalex.org/W2133392939","https://openalex.org/W2145243417","https://openalex.org/W2146471456","https://openalex.org/W2158029166","https://openalex.org/W2161439427","https://openalex.org/W2167508847","https://openalex.org/W2496163386","https://openalex.org/W2496495744","https://openalex.org/W2566335580","https://openalex.org/W2611804663","https://openalex.org/W2917997019","https://openalex.org/W3184314314","https://openalex.org/W4229970255","https://openalex.org/W4237496336","https://openalex.org/W4249318479","https://openalex.org/W4293860921","https://openalex.org/W6606840743","https://openalex.org/W6608311587","https://openalex.org/W6634289902","https://openalex.org/W6643528380"],"related_works":["https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W2389521946","https://openalex.org/W1608414128","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W159504299","https://openalex.org/W2096382750","https://openalex.org/W2094388041","https://openalex.org/W3102280101"],"abstract_inverted_index":{"Proving":[0],"integrality":[1,30],"gaps":[2],"for":[3,34,40],"linear":[4,38],"relaxations":[5,39],"of":[6,32,37],"NP":[7],"optimization":[8],"problems":[9,50],"is":[10],"a":[11,18,23],"difficult":[12],"task":[13],"and":[14,43],"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-o(1)":[33],"three":[35],"families":[36],"vertex":[41],"cover,":[42],"our":[44],"methods":[45],"seem":[46],"relevant":[47],"to":[48],"other":[49],"as":[51],"well.":[52]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}