{"id":"https://openalex.org/W2116510751","doi":"https://doi.org/10.1109/allerton.2009.5394484","title":"Graph covers and quadratic minimization","display_name":"Graph covers and quadratic minimization","publication_year":2009,"publication_date":"2009-09-01","ids":{"openalex":"https://openalex.org/W2116510751","doi":"https://doi.org/10.1109/allerton.2009.5394484","mag":"2116510751"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2009.5394484","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2009.5394484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5017484756","display_name":"Nicholas Ruozzi","orcid":"https://orcid.org/0000-0002-4262-2698"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nicholas Ruozzi","raw_affiliation_strings":["Computer Science, Yale University, New Heaven, CT, USA","Computer Science, Yale University, New Haven, CT 06520, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science, Yale University, New Heaven, CT, USA","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"Computer Science, Yale University, New Haven, CT 06520, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080601320","display_name":"Justin Thaler","orcid":"https://orcid.org/0009-0009-2234-6225"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]},{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Justin Thaler","raw_affiliation_strings":["Computer Science, Harvard University, Cambridge, MA, USA","Computer Science, Harvard University, Cambridge, MA 02138, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science, Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I2801851002"]},{"raw_affiliation_string":"Computer Science, Harvard University, Cambridge, MA 02138, USA","institution_ids":["https://openalex.org/I136199984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072765803","display_name":"Sekhar Tatikonda","orcid":"https://orcid.org/0000-0002-8956-6208"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sekhar Tatikonda","raw_affiliation_strings":["Electrical Engineering, Yale University, New Heaven, CT, USA","Electrical Engineering, Yale University, New Haven, CT 06520, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering, Yale University, New Heaven, CT, USA","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"Electrical Engineering, Yale University, New Haven, CT 06520, USA","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5017484756"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":2.6917,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.9035892,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"7","issue":null,"first_page":"1590","last_page":"1596"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9990000128746033,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9987000226974487,"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/quadratic-equation","display_name":"Quadratic equation","score":0.656823992729187},{"id":"https://openalex.org/keywords/diagonally-dominant-matrix","display_name":"Diagonally dominant matrix","score":0.636709451675415},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5998860001564026},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.5892882347106934},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5772363543510437},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5666059851646423},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5283625721931458},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42574721574783325},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4257383644580841},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4214927554130554},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.41136324405670166},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3720191717147827},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3700106143951416},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.353443443775177},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23513635993003845},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1339695155620575},{"id":"https://openalex.org/keywords/invertible-matrix","display_name":"Invertible matrix","score":0.07801663875579834}],"concepts":[{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.656823992729187},{"id":"https://openalex.org/C84507854","wikidata":"https://www.wikidata.org/wiki/Q952222","display_name":"Diagonally dominant matrix","level":3,"score":0.636709451675415},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5998860001564026},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.5892882347106934},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5772363543510437},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5666059851646423},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5283625721931458},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42574721574783325},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4257383644580841},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4214927554130554},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.41136324405670166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3720191717147827},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3700106143951416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.353443443775177},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23513635993003845},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1339695155620575},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.07801663875579834},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2009.5394484","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2009.5394484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1545381479","https://openalex.org/W1560512119","https://openalex.org/W1588943481","https://openalex.org/W1640741887","https://openalex.org/W1648500155","https://openalex.org/W1968191405","https://openalex.org/W1983289383","https://openalex.org/W2111521164","https://openalex.org/W2962897197","https://openalex.org/W3103301362","https://openalex.org/W6632641389","https://openalex.org/W6633434192","https://openalex.org/W6635197353","https://openalex.org/W6636795031","https://openalex.org/W6637054791","https://openalex.org/W6676628830","https://openalex.org/W6785338372"],"related_works":["https://openalex.org/W2367535589","https://openalex.org/W2487162673","https://openalex.org/W2942366970","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W2136336099","https://openalex.org/W2550293690","https://openalex.org/W1529195008","https://openalex.org/W2357224165","https://openalex.org/W2139574475"],"abstract_inverted_index":{"We":[0,62],"formulate":[1],"a":[2,23,47,79,123],"new":[3],"approach":[4,41],"to":[5,69,86,92],"understanding":[6,65,127],"the":[7,10,15,52,57,71,75,88,94,116,128],"behavior":[8,73,96],"of":[9,17,27,34,54,59,66,74,97,104,118,132],"min-sum":[11,55,76,98],"algorithm":[12,77],"by":[13,114],"exploiting":[14],"properties":[16],"graph":[18,35,67,120],"covers.":[19],"First,":[20],"we":[21,83,111],"present":[22],"new,":[24],"natural":[25],"characterization":[26],"scaled":[28,43],"diagonally":[29],"dominant":[30],"matrices":[31],"in":[32,56],"terms":[33],"covers;":[36],"this":[37],"result":[38],"motivates":[39],"our":[40,64,105],"because":[42],"diagonal":[44],"dominance":[45],"is":[46],"known":[48],"sufficient":[49],"condition":[50],"for":[51,99,126],"convergence":[53],"case":[58],"quadratic":[60],"minimization.":[61],"use":[63],"covers":[68,121],"characterize":[70],"periodic":[72],"on":[78],"single":[80,89],"cycle.":[81],"Lastly,":[82],"explain":[84],"how":[85],"extend":[87],"cycle":[90],"results":[91],"understand":[93],"2-periodic":[95],"general":[100,133],"pairwise":[101],"MRFs.":[102],"Some":[103],"techniques":[106],"apply":[107],"more":[108],"broadly,":[109],"and":[110,130],"believe":[112],"that":[113],"capturing":[115],"notion":[117],"indistinguishability,":[119],"represent":[122],"valuable":[124],"tool":[125],"abilities":[129],"limitations":[131],"message-passing":[134],"algorithms.":[135]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}