{"id":"https://openalex.org/W2094911282","doi":"https://doi.org/10.1137/070683520","title":"Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization","display_name":"Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2094911282","doi":"https://doi.org/10.1137/070683520","mag":"2094911282"},"language":"en","primary_location":{"id":"doi:10.1137/070683520","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070683520","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"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 Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ir.cwi.nl/pub/11833","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008319452","display_name":"Neboj\u0161a Gvozdenovi\u0107","orcid":"https://orcid.org/0000-0002-9230-9528"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neboj\u0161a Gvozdenovi\u0107","raw_affiliation_strings":["N.Gvozdenovic@cwi.nl and M.Laurent@cwi.nl#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"N.Gvozdenovic@cwi.nl and M.Laurent@cwi.nl#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047819350","display_name":"Monique Laurent","orcid":"https://orcid.org/0000-0001-8474-2121"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Monique Laurent","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.5536,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.94517086,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"19","issue":"2","first_page":"592","last_page":"615"},"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.9922999739646912,"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.9922999739646912,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.98089998960495,"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/mathematics","display_name":"Mathematics","score":0.7888895273208618},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7223392128944397},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6464394927024841},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.6212337613105774},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5017805099487305},{"id":"https://openalex.org/keywords/hamming-graph","display_name":"Hamming graph","score":0.49111244082450867},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4848945736885071},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4531472325325012},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4152301847934723},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.19561299681663513},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1303025782108307},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12712997198104858},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.07788446545600891},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.0757589340209961}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7888895273208618},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7223392128944397},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6464394927024841},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.6212337613105774},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5017805099487305},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.49111244082450867},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4848945736885071},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4531472325325012},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4152301847934723},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.19561299681663513},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1303025782108307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12712997198104858},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.07788446545600891},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0757589340209961},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/070683520","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070683520","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"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 Optimization","raw_type":"journal-article"},{"id":"pmh:cwi:oai:cwi.nl:11833","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/11833","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":"","raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:cwi:oai:cwi.nl:12807","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/12807","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 Optimization, 19(02), 592 - 615","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:ner:tilbur:urn:nbn:nl:ui:12-3959920","is_oa":false,"landing_page_url":"http://arno.uvt.nl/show.cgi?fid=106079","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"preprint"}],"best_oa_location":{"id":"pmh:cwi:oai:cwi.nl:11833","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/11833","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":"","raw_type":"info:eu-repo/semantics/other"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1582334898","https://openalex.org/W1970686950","https://openalex.org/W1980032383","https://openalex.org/W1998838742","https://openalex.org/W2003995429","https://openalex.org/W2034904496","https://openalex.org/W2043473394","https://openalex.org/W2052435807","https://openalex.org/W2058237467","https://openalex.org/W2069572432","https://openalex.org/W2069816168","https://openalex.org/W2077397558","https://openalex.org/W2092998591","https://openalex.org/W2097900174","https://openalex.org/W2104385491","https://openalex.org/W2121547771","https://openalex.org/W2144606698","https://openalex.org/W4237627436"],"related_works":["https://openalex.org/W2284570459","https://openalex.org/W2125677183","https://openalex.org/W3087852249","https://openalex.org/W2095076239","https://openalex.org/W3117600307","https://openalex.org/W2385671392","https://openalex.org/W2610737932","https://openalex.org/W2952342369","https://openalex.org/W4291863732","https://openalex.org/W2042289434"],"abstract_inverted_index":{"Recently":[0],"we":[1,26,146,189],"investigated":[2],"in":[3,92],"[SIAM":[4,93],"J.":[5,94],"Optim.,":[6,95],"19":[7,96],"(2008),":[8,97],"pp.":[9,98,164],"572\u2013591]":[10],"hierarchies":[11,29,54],"of":[12,20,30,49,85,151,185],"semidefinite":[13,137],"approximations":[14],"for":[15,78,110,141],"the":[16,33,37,42,46,55,62,67,86,131,148,152,171,179,186,191],"chromatic":[17,39,47],"number":[18,40,48],"$\\chi(G)$":[19],"a":[21,50,122],"graph":[22],"G.":[23],"In":[24,52,139],"particular,":[25,140],"introduced":[27],"two":[28],"lower":[31,194],"bounds:":[32],"\u201c$\\psi$\u201d-hierarchy":[34],"converging":[35,44],"to":[36,45,61,76,129],"fractional":[38],"and":[41,115,143],"\u201c$\\Psi$\u201d-hierarchy":[43],"graph.":[51],"both":[53],"first":[56],"order":[57,69,88],"bounds":[58,70,89,109,132,173,195],"are":[59,90],"related":[60],"Lov\u00e1sz":[63,180],"theta":[64,181],"number,":[65],"while":[66],"second":[68,87],"would":[71],"already":[72],"be":[73,175],"too":[74],"costly":[75],"compute":[77,130],"large":[79],"graphs.":[80,118],"As":[81],"an":[82],"alternative,":[83],"relaxations":[84],"proposed":[91],"572\u2013591].":[99],"We":[100],"present":[101],"here":[102],"our":[103],"experimental":[104],"results":[105,168],"with":[106],"these":[107],"relaxed":[108],"Hamming":[111,142],"graphs,":[112,114,145],"Kneser":[113,144],"DIMACS":[116,187],"benchmark":[117],"Symmetry":[119],"reduction":[120],"plays":[121],"crucial":[123],"role":[124],"as":[125],"it":[126],"permits":[127],"us":[128],"by":[133,156],"using":[134],"more":[135],"compact":[136],"programs.":[138],"use":[147],"explicit":[149],"block-diagonalization":[150],"Terwilliger":[153],"algebra":[154],"given":[155],"Schrijver":[157],"[IEEE":[158],"Trans.":[159],"Inform.":[160],"Theory,":[161],"51":[162],"(2005),":[163],"2859\u20132866].":[165],"Our":[166],"numerical":[167],"indicate":[169],"that":[170],"new":[172],"can":[174],"much":[176],"stronger":[177],"than":[178],"number.":[182],"For":[183],"some":[184],"instances":[188],"improve":[190],"best":[192],"known":[193],"significantly.":[196]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}