{"id":"https://openalex.org/W4376639551","doi":"https://doi.org/10.1145/3564246.3585112","title":"Approximate Graph Colouring and the Hollow Shadow","display_name":"Approximate Graph Colouring and the Hollow Shadow","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639551","doi":"https://doi.org/10.1145/3564246.3585112"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585112","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","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/A5085042017","display_name":"Lorenzo Ciardo","orcid":"https://orcid.org/0000-0001-9491-2016"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Lorenzo Ciardo","raw_affiliation_strings":["University of Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067656814","display_name":"Stanislav \u017divn\u00fd","orcid":"https://orcid.org/0000-0002-0263-159X"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Stanislav \u017divn\u00fd","raw_affiliation_strings":["University of Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085042017"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":2.5561,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.91046064,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"623","last_page":"631"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976999759674072,"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.9776999950408936,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.6045936346054077},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5665481090545654},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5549142360687256},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5360819101333618},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.496498167514801},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4655376672744751},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.428204208612442},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4192636013031006},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37430810928344727},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3296814560890198},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3086857795715332},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1227145791053772}],"concepts":[{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.6045936346054077},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5665481090545654},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5549142360687256},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5360819101333618},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.496498167514801},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4655376672744751},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.428204208612442},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4192636013031006},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37430810928344727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3296814560890198},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3086857795715332},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1227145791053772}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3564246.3585112","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:d09de36f-a45a-4883-ad90-32feb964850b","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:d09de36f-a45a-4883-ad90-32feb964850b","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Conference item"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8702647912","display_name":null,"funder_award_id":"EP/X024431/1","funder_id":"https://openalex.org/F4320314731","funder_display_name":"UK Research and Innovation"}],"funders":[{"id":"https://openalex.org/F4320314731","display_name":"UK Research and Innovation","ror":"https://ror.org/001aqnf71"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":69,"referenced_works":["https://openalex.org/W29025891","https://openalex.org/W1492972816","https://openalex.org/W1587123489","https://openalex.org/W1969999211","https://openalex.org/W1970462956","https://openalex.org/W1972776379","https://openalex.org/W1982506822","https://openalex.org/W1997657048","https://openalex.org/W1997672673","https://openalex.org/W2002025272","https://openalex.org/W2018850502","https://openalex.org/W2020154454","https://openalex.org/W2025904765","https://openalex.org/W2031923588","https://openalex.org/W2047861934","https://openalex.org/W2049087128","https://openalex.org/W2049143039","https://openalex.org/W2057432440","https://openalex.org/W2077397558","https://openalex.org/W2077658979","https://openalex.org/W2104254886","https://openalex.org/W2120358419","https://openalex.org/W2132991500","https://openalex.org/W2133404041","https://openalex.org/W2145778479","https://openalex.org/W2150339067","https://openalex.org/W2166566648","https://openalex.org/W2314918483","https://openalex.org/W2334698612","https://openalex.org/W2401610261","https://openalex.org/W2472217601","https://openalex.org/W2510500928","https://openalex.org/W2514739098","https://openalex.org/W2516889374","https://openalex.org/W2529974411","https://openalex.org/W2600945321","https://openalex.org/W2625656873","https://openalex.org/W2758570758","https://openalex.org/W2787022562","https://openalex.org/W2809286765","https://openalex.org/W2809340088","https://openalex.org/W2884037933","https://openalex.org/W2885551440","https://openalex.org/W2898776142","https://openalex.org/W2962785950","https://openalex.org/W2963010019","https://openalex.org/W2977636792","https://openalex.org/W2989790471","https://openalex.org/W2999363642","https://openalex.org/W3081785465","https://openalex.org/W3089642129","https://openalex.org/W3129403085","https://openalex.org/W3133822674","https://openalex.org/W3139029615","https://openalex.org/W3177905337","https://openalex.org/W3186467916","https://openalex.org/W3193302153","https://openalex.org/W3194809555","https://openalex.org/W3207594656","https://openalex.org/W3212768336","https://openalex.org/W4206427716","https://openalex.org/W4223559044","https://openalex.org/W4281885517","https://openalex.org/W4283769947","https://openalex.org/W4293248662","https://openalex.org/W4301808069","https://openalex.org/W4316652373","https://openalex.org/W4316652390","https://openalex.org/W4376639551"],"related_works":["https://openalex.org/W1583652181","https://openalex.org/W2045837509","https://openalex.org/W4205249516","https://openalex.org/W2001053389","https://openalex.org/W2088744863","https://openalex.org/W2012703063","https://openalex.org/W1978407276","https://openalex.org/W1942724698","https://openalex.org/W1981952725","https://openalex.org/W2093952308"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2],"approximate":[3],"graph":[4],"colouring":[5],"is":[6],"not":[7],"solved":[8],"by":[9],"constantly":[10],"many":[11],"levels":[12],"of":[13,33,51],"the":[14,18],"lift-and-project":[15],"hierarchy":[16],"for":[17],"combined":[19],"basic":[20],"linear":[21],"programming":[22,26],"and":[23,43],"affine":[24],"integer":[25],"relaxation.":[27],"The":[28],"proof":[29],"involves":[30],"a":[31,45],"construction":[32],"tensors":[34],"whose":[35],"fixed-dimensional":[36],"projections":[37],"are":[38],"equal":[39],"up":[40],"to":[41],"reflection":[42],"satisfy":[44],"sparsity":[46],"condition,":[47],"which":[48],"may":[49],"be":[50],"independent":[52],"interest.":[53]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}