{"id":"https://openalex.org/W3035322289","doi":"https://doi.org/10.1145/3357713.3384264","title":"Bipartite TSP in o(1.9999\u207f) time, assuming quadratic time matrix multiplication","display_name":"Bipartite TSP in o(1.9999\u207f) time, assuming quadratic time matrix multiplication","publication_year":2020,"publication_date":"2020-06-22","ids":{"openalex":"https://openalex.org/W3035322289","doi":"https://doi.org/10.1145/3357713.3384264","mag":"3035322289"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384264","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Utrecht University, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utrecht University, Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068357631"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":0.6733,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6024898,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"40","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9983999729156494,"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/bipartite-graph","display_name":"Bipartite graph","score":0.8029365539550781},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7954691648483276},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6878138780593872},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6225305795669556},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.5921226739883423},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5551599264144897},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5378621816635132},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5228314995765686},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.44619542360305786},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4337659478187561},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.41328519582748413},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38541895151138306},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30633655190467834},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22142398357391357}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8029365539550781},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7954691648483276},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6878138780593872},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6225305795669556},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.5921226739883423},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5551599264144897},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5378621816635132},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5228314995765686},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.44619542360305786},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4337659478187561},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.41328519582748413},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38541895151138306},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30633655190467834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22142398357391357},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3357713.3384264","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/414806","is_oa":false,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/414806","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020, 40. ACM","raw_type":"info:eu-repo/semantics/bookpart"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6899999976158142,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321651","display_name":"Technische Universiteit Eindhoven","ror":"https://ror.org/02c2kyt77"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W626716816","https://openalex.org/W1715975119","https://openalex.org/W1852383912","https://openalex.org/W1968245619","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1973081829","https://openalex.org/W1975286948","https://openalex.org/W1995725694","https://openalex.org/W2001868457","https://openalex.org/W2012438638","https://openalex.org/W2012473793","https://openalex.org/W2048068744","https://openalex.org/W2052142033","https://openalex.org/W2059273723","https://openalex.org/W2080132708","https://openalex.org/W2120141762","https://openalex.org/W2120248756","https://openalex.org/W2153063335","https://openalex.org/W2174446922","https://openalex.org/W2176527690","https://openalex.org/W2216833188","https://openalex.org/W2273528466","https://openalex.org/W2282727044","https://openalex.org/W2296469570","https://openalex.org/W2320187540","https://openalex.org/W2408491755","https://openalex.org/W2508797883","https://openalex.org/W2525537616","https://openalex.org/W2594913545","https://openalex.org/W2596605817","https://openalex.org/W2608950249","https://openalex.org/W2745594004","https://openalex.org/W2752311959","https://openalex.org/W2782346863","https://openalex.org/W2785162637","https://openalex.org/W2794350243","https://openalex.org/W2800453060","https://openalex.org/W2883221138","https://openalex.org/W2892948282","https://openalex.org/W2898839814","https://openalex.org/W2921785090","https://openalex.org/W2950262288","https://openalex.org/W3021494513","https://openalex.org/W3102266534","https://openalex.org/W3139078859","https://openalex.org/W4238913085","https://openalex.org/W4242361212","https://openalex.org/W4247564011","https://openalex.org/W6632353237","https://openalex.org/W6676891494"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2054495636","https://openalex.org/W4306878646","https://openalex.org/W4241541331","https://openalex.org/W2016168023","https://openalex.org/W2259723333","https://openalex.org/W2063001402","https://openalex.org/W1988067232"],"abstract_inverted_index":{"The":[0],"symmetric":[1],"traveling":[2],"salesman":[3],"problem":[4,8,51],"(TSP)":[5],"is":[6],"the":[7,11,54,69],"of":[9,85],"finding":[10],"shortest":[12],"Hamiltonian":[13],"cycle":[14],"in":[15,38,78,87,93,118],"an":[16],"edge-weighted":[17],"undirected":[18],"graph.":[19],"In":[20,64],"1962":[21],"Bellman,":[22],"and":[23,26],"independently":[24],"Held":[25],"Karp,":[27],"showed":[28],"that":[29],"TSP":[30,86,117],"instances":[31,84],"with":[32,102],"n":[33,41,58,95],"cities":[34],"can":[35,75,90],"be":[36,76,91,113],"solved":[37,92],"O(n":[39],"22":[40],")":[42,59,96],"time.":[43],"Since":[44],"then":[45],"it":[46],"has":[47],"been":[48],"a":[49,99],"notorious":[50],"to":[52,56,115],"improve":[53],"runtime":[55],"O((2\u2212\u0454)":[57],"for":[60],"some":[61],"constant":[62,103],"\u0454>0.":[63],"this":[65],"work":[66],"we":[67],"establish":[68],"following":[70],"progress:":[71],"If":[72],"(s\u00d7":[73],"s)-matrices":[74],"multiplied":[77],"s":[79],"2+o(1)":[80],"time,":[81],"than":[82],"all":[83],"bipartite":[88],"graphs":[89],"O(1.9999":[94],"time":[97],"by":[98],"randomized":[100],"algorithm":[101],"error":[104],"probability.":[105],"We":[106],"also":[107],"indicate":[108],"how":[109],"our":[110],"methods":[111],"may":[112],"useful":[114],"solve":[116],"non-bipartite":[119],"graphs.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}