{"id":"https://openalex.org/W7151732320","doi":"https://doi.org/10.48550/arxiv.2604.05645","title":"Improved space-time tradeoff for TSP via extremal set systems","display_name":"Improved space-time tradeoff for TSP via extremal set systems","publication_year":2026,"publication_date":"2026-04-07","ids":{"openalex":"https://openalex.org/W7151732320","doi":"https://doi.org/10.48550/arxiv.2604.05645"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.05645","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.05645","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.05645","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088209970","display_name":"Justin Dallant","orcid":"https://orcid.org/0000-0001-5539-9037"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dallant, Justin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133211127","display_name":"L\u00e1szl\u00f3 Kozma","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kozma, L\u00e1szl\u00f3","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088209970"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.4138000011444092,"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.4138000011444092,"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.2822999954223633,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.06019999831914902,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6359000205993652},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6176000237464905},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.564300000667572},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5182999968528748},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5146999955177307},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42739999294281006},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4180000126361847}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6941999793052673},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6359000205993652},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6176000237464905},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.564300000667572},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5182999968528748},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5146999955177307},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4697999954223633},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43709999322891235},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42739999294281006},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4180000126361847},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3910999894142151},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.35519999265670776},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.34040001034736633},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.32710000872612},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2773999869823456},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.05645","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.05645","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":"doi:10.48550/arxiv.2604.05645","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.05645","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,193],"traveling":[1],"salesman":[2],"problem":[3],"(TSP)":[4],"is":[5,177,198],"a":[6,114,130,152,168,187,215,241],"cornerstone":[7],"of":[8,17,41,57,74,88,116,133,170,180,190,195,199,218,230,244],"combinatorial":[9,216],"optimization":[10],"and":[11,23,44,51,53,59,68,82,109,121,136,221],"has":[12,144],"deeply":[13],"influenced":[14],"the":[15,29,38,54,75,89,178,211,228,231],"development":[16],"algorithmic":[18],"techniques":[19,238],"in":[20,202,254],"both":[21],"exact":[22],"approximate":[24],"settings.":[25],"Yet,":[26],"improving":[27],"on":[28],"decades-old":[30],"bounds":[31],"for":[32,160,235],"solving":[33],"TSP":[34],"exactly":[35],"remains":[36],"elusive:":[37],"dynamic":[39],"program":[40],"Bellman,":[42],"Held,":[43],"Karp":[45],"from":[46,61,223],"1962":[47],"uses":[48,63],"$2^{n+O(\\log{n})}$":[49],"time":[50,67,81],"space,":[52],"divide-and-conquer":[55],"approach":[56],"Gurevich":[58],"Shelah":[60],"1987":[62],"$4^{n":[64],"+":[65],"O(\\log^2{n})}$":[66],"polynomial":[69],"space.":[70],"A":[71,174],"straightforward":[72],"combination":[73],"two":[76],"algorithms":[77],"trades":[78],"off":[79],"$T^{n+o(n)}$":[80],"$S^{n+o(n)}$":[83],"space":[84],"at":[85],"various":[86],"points":[87],"curve":[90],"$ST":[91,117,171],"=":[92],"4$.":[93],"An":[94],"improvement":[95,140],"to":[96,126,137,206,240],"this":[97,148],"tradeoff":[98,153,233],"when":[99],"$2":[100,162],"<":[101,103,163,165,172],"T":[102,164],"2\\sqrt{2}$":[104],"was":[105],"found":[106],"by":[107],"Koivisto":[108,120],"Parviainen":[110,122],"(SODA":[111],"2010),":[112],"yielding":[113,250],"minimum":[115,169],"\\approx":[118],"3.93$.":[119],"show":[123],"their":[124],"method":[125,143],"be":[127],"optimal":[128],"among":[129],"broad":[131,242],"class":[132,243],"partial-order-based":[134],"approaches,":[135],"date,":[138],"no":[139],"or":[141],"alternative":[142],"been":[145],"found.":[146],"In":[147],"paper":[149],"we":[150,213],"give":[151],"that":[154,185],"strictly":[155],"improves":[156],"all":[157,161],"previous":[158,232],"ones":[159],"4$,":[166],"achieving":[167],"3.572$.":[173],"key":[175],"ingredient":[176],"construction":[179],"sparse":[181],"set":[182],"systems":[183],"(hypergraphs)":[184],"admit":[186],"large":[188],"number":[189],"maximal":[191],"chains.":[192],"existence":[194],"such":[196],"objects":[197],"independent":[200],"interest":[201],"extremal":[203],"combinatorics,":[204],"likely":[205],"see":[207],"further":[208],"applications.":[209],"Along":[210],"way":[212],"disprove":[214],"conjecture":[217],"Johnson,":[219],"Leader,":[220],"Russell":[222],"2013,":[224],"relating":[225],"it":[226],"with":[227],"optimality":[229],"schemes":[234],"TSP.":[236],"Our":[237],"extend":[239],"permutation":[245],"problems":[246],"over":[247],"arbitrary":[248],"semirings,":[249],"improved":[251],"space-time":[252],"tradeoffs":[253],"these":[255],"settings":[256],"as":[257],"well.":[258]},"counts_by_year":[],"updated_date":"2026-04-09T06:13:59.934233","created_date":"2026-04-09T00:00:00"}