{"id":"https://openalex.org/W4213395600","doi":"https://doi.org/10.1145/3519935.3519984","title":"A subpolynomial approximation algorithm for graph crossing number in low-degree graphs","display_name":"A subpolynomial approximation algorithm for graph crossing number in low-degree graphs","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4213395600","doi":"https://doi.org/10.1145/3519935.3519984"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3519984","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3519984","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2202.06827","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056023203","display_name":"Julia Chuzhoy","orcid":"https://orcid.org/0000-0001-7839-751X"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Julia Chuzhoy","raw_affiliation_strings":["Toyota Technological Institute at Chicago, USA"],"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago, USA","institution_ids":["https://openalex.org/I160992636"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072885035","display_name":"Zihan Tan","orcid":"https://orcid.org/0000-0003-4844-8480"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zihan Tan","raw_affiliation_strings":["University of Chicago, USA"],"affiliations":[{"raw_affiliation_string":"University of Chicago, USA","institution_ids":["https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056023203"],"corresponding_institution_ids":["https://openalex.org/I160992636"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03550829,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"303","last_page":"316"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9825999736785889,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9825999736785889,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9527999758720398,"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.9516000151634216,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7995785474777222},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6902983784675598},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6447927951812744},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6087285280227661},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6041359901428223},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4432271420955658},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4229195713996887},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.399355411529541},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39907270669937134},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12884658575057983}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7995785474777222},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6902983784675598},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6447927951812744},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6087285280227661},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6041359901428223},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4432271420955658},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4229195713996887},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.399355411529541},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39907270669937134},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12884658575057983},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3519935.3519984","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3519984","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2202.06827","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2202.06827","pdf_url":"https://arxiv.org/pdf/2202.06827","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2202.06827","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2202.06827","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2202.06827","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2202.06827","pdf_url":"https://arxiv.org/pdf/2202.06827","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4213395600.pdf"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W13988344","https://openalex.org/W1535274625","https://openalex.org/W1550469572","https://openalex.org/W1976460919","https://openalex.org/W1987374783","https://openalex.org/W2028446993","https://openalex.org/W2057826895","https://openalex.org/W2060538865","https://openalex.org/W2069815120","https://openalex.org/W2075645139","https://openalex.org/W2085348754","https://openalex.org/W2088844265","https://openalex.org/W2149348205","https://openalex.org/W2150148016","https://openalex.org/W2286720753","https://openalex.org/W2902524093","https://openalex.org/W2953105898","https://openalex.org/W2963513631","https://openalex.org/W2963920039","https://openalex.org/W6633736242"],"related_works":["https://openalex.org/W4805079","https://openalex.org/W6207231","https://openalex.org/W5774801","https://openalex.org/W10838923","https://openalex.org/W14232539","https://openalex.org/W1017985","https://openalex.org/W10598665","https://openalex.org/W6398434","https://openalex.org/W3297276","https://openalex.org/W1060427"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,19,23,28,53,61,83,115,120],"classical":[3],"Minimum":[4,110],"Crossing":[5,111],"Number":[6],"problem:":[7],"given":[8],"an":[9,73],"n-vertex":[10],"graph":[11],"G,":[12],"compute":[13],"a":[14,35,77,90,105,124],"drawing":[15],"of":[16,25,30,96],"G":[17],"in":[18,65,93,126,132,140],"plane,":[20],"while":[21,82],"minimizing":[22],"number":[24],"crossings":[26],"between":[27],"images":[29],"its":[31],"edges.":[32],"This":[33,113],"is":[34,44,87,114,138],"fundamental":[36],"and":[37],"extensively":[38],"studied":[39],"problem,":[40],"whose":[41,134],"approximability":[42],"status":[43],"widely":[45],"open.":[46],"In":[47,100],"all":[48],"currently":[49],"known":[50],"approximation":[51,54,70,117,128],"algorithms,":[52],"factor":[55,129],"depends":[56],"polynomially":[57],"on":[58],"\u0394":[59],"\u2013":[60],"maximum":[62,135],"vertex":[63,136],"degree":[64,137],"G.":[66],"The":[67],"best":[68,84],"current":[69],"algorithm":[71,108,118],"achieves":[72,123],"O(n1/2\u2212\u00b7":[74],"(\u0394\u00b7logn))-approximation,":[75],"for":[76,109,119],"small":[78],"fixed":[79],"constant":[80],"\u0454,":[81],"negative":[85],"result":[86],"APX-hardness,":[88],"leaving":[89],"large":[91],"gap":[92],"our":[94],"understanding":[95],"this":[97,101],"basic":[98],"problem.":[99],"paper":[102],"we":[103],"design":[104],"randomized":[106],"O(2O((logn)7/8loglogn)\u00b7(\u0394))-approximation":[107],"Number.":[112],"first":[116],"problem":[121],"that":[122],"subpolynomial":[125,139],"n":[127],"(albeit":[130],"only":[131],"graphs":[133],"n).":[141]},"counts_by_year":[],"updated_date":"2026-03-21T08:13:44.787528","created_date":"2022-02-24T00:00:00"}