{"id":"https://openalex.org/W2810614232","doi":"https://doi.org/10.1137/15m1051002","title":"On the Lov\u00e1sz Theta Function for Independent Sets in Sparse Graphs","display_name":"On the Lov\u00e1sz Theta Function for Independent Sets in Sparse Graphs","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2810614232","doi":"https://doi.org/10.1137/15m1051002","mag":"2810614232"},"language":"en","primary_location":{"id":"doi:10.1137/15m1051002","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1051002","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":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/984b1551-45fd-437b-8a28-cf1eed5483f1","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]},{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL","US"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213","CWI, 1098 XG Amsterdam, The Netherlands","Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands, and"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"CWI, 1098 XG Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands, and","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065794037","display_name":"Guru Guruganesh","orcid":"https://orcid.org/0000-0003-0963-3843"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guru Guruganesh","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I74973139","https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.4275,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.65003743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"47","issue":"3","first_page":"1039","last_page":"1055"},"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.9986000061035156,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8195793628692627},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6687737703323364},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5406420230865479},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5294394493103027},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5284875631332397},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5004575252532959},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4785526394844055},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.463351309299469},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4600929617881775},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.4339943528175354},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21874713897705078},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11521023511886597}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8195793628692627},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6687737703323364},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5406420230865479},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5294394493103027},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5284875631332397},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5004575252532959},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4785526394844055},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.463351309299469},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4600929617881775},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.4339943528175354},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21874713897705078},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11521023511886597},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/15m1051002","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1051002","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"},{"id":"pmh:oai:pure.tue.nl:openaire/984b1551-45fd-437b-8a28-cf1eed5483f1","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/984b1551-45fd-437b-8a28-cf1eed5483f1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Gupta, A & Guruganesh, G 2018, 'On the Lov\u00e1sz Theta function for independent sets in sparse graphs', SIAM Journal on Computing, vol. 47, no. 3, pp. 1039-1055. https://doi.org/10.1137/15M1051002","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:cwi.nl:27843","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/27843","pdf_url":"https://ir.cwi.nl/pub/27843/15m1051002.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing vol. 47 no. 3, pp. 1039-1055","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:publications/984b1551-45fd-437b-8a28-cf1eed5483f1","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85049470514&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bansal, N, Gupta, A & Guruganesh, G 2018, 'On the Lov\u00e1sz Theta function for independent sets in sparse graphs', SIAM Journal on Computing, vol. 47, no. 3, pp. 1039-1055. https://doi.org/10.1137/15M1051002","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/984b1551-45fd-437b-8a28-cf1eed5483f1","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/984b1551-45fd-437b-8a28-cf1eed5483f1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 47(3), 1039 - 1055. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/984b1551-45fd-437b-8a28-cf1eed5483f1","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/984b1551-45fd-437b-8a28-cf1eed5483f1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Gupta, A & Guruganesh, G 2018, 'On the Lov\u00e1sz Theta function for independent sets in sparse graphs', SIAM Journal on Computing, vol. 47, no. 3, pp. 1039-1055. https://doi.org/10.1137/15M1051002","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1502437098","display_name":null,"funder_award_id":"CCF-1319811","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1664046972","display_name":null,"funder_award_id":"639.022.211","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G2909349068","display_name":null,"funder_award_id":"1319811","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G4938272535","display_name":null,"funder_award_id":"1016799","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G628422989","display_name":null,"funder_award_id":"617951","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G6755165505","display_name":null,"funder_award_id":"award","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6835921093","display_name":"AF: Small: Future Directions in Approximation Algorithms Research","funder_award_id":"1016799","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7246788265","display_name":"AF: Small: Approximation Algorithms for Uncertain Environments and Graph Partitioning","funder_award_id":"1319811","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","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/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1491127810","https://openalex.org/W1964543450","https://openalex.org/W1971749164","https://openalex.org/W2011869755","https://openalex.org/W2017052164","https://openalex.org/W2048800330","https://openalex.org/W2053777090","https://openalex.org/W2069816168","https://openalex.org/W2074465184","https://openalex.org/W2074920973","https://openalex.org/W2077397558","https://openalex.org/W2078289947","https://openalex.org/W2078604563","https://openalex.org/W2124088817","https://openalex.org/W2133795933","https://openalex.org/W2149135074","https://openalex.org/W2162218992","https://openalex.org/W2171872921","https://openalex.org/W2607541376"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W2052169362","https://openalex.org/W1608733163","https://openalex.org/W2623150993","https://openalex.org/W1983915440","https://openalex.org/W3095925971"],"abstract_inverted_index":{"We":[0,14,62],"consider":[1],"the":[2,17,34,51,76,80,89],"maximum":[3,11],"independent":[4],"set":[5],"problem":[6],"on":[7,33,45,50],"sparse":[8],"graphs":[9,56],"with":[10],"degree":[12],"$d$.":[13],"show":[15,64],"that":[16,65],"Lov\u00e1sz":[18],"$\\vartheta$-function":[19],"based":[20,44],"semidefinite":[21,78],"program":[22],"(SDP)":[23],"has":[24],"an":[25,103],"integrality":[26,81,109],"gap":[27,82,110],"of":[28,38,54,60,75,106,116,122],"$":[29],"\\widetilde{O}(d/\\log^{3/2}":[30],"d)$,":[31],"improving":[32],"previous":[35],"best":[36,90],"result":[37,93],"$\\widetilde{O}(d/\\log":[39],"d)$.":[40,86],"This":[41,87],"improvement":[42],"is":[43],"a":[46,119],"new":[47],"Ramsey-theoretic":[48],"bound":[49],"independence":[52],"number":[53],"$K_r$-free":[55],"for":[57,66],"large":[58],"values":[59],"$r$.":[61],"also":[63],"stronger":[67],"SDPs,":[68],"namely,":[69],"those":[70],"obtained":[71],"using":[72,113],"poly$\\log(d)$":[73],"levels":[74,115],"${SA}^{+}$":[77],"hierarchy,":[79],"reduces":[83],"to":[84,95],"$\\widetilde{O}(d/\\log^2":[85],"matches":[88],"unique-games-based":[91],"hardness":[92],"up":[94],"lower-order":[96],"poly$(\\log\\log":[97],"d)$":[98],"factors.":[99],"Finally,":[100],"we":[101],"give":[102],"algorithmic":[104],"version":[105],"this":[107],"${SA}^{+}$-based":[108],"result,":[111],"albeit":[112],"$d$":[114],"${SA}^{+}$,":[117],"via":[118],"coloring":[120],"algorithm":[121],"Johansson.":[123]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}