{"id":"https://openalex.org/W2137653883","doi":"https://doi.org/10.1137/15m1010531","title":"Reassembling Trees for the Traveling Salesman","display_name":"Reassembling Trees for the Traveling Salesman","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2137653883","doi":"https://doi.org/10.1137/15m1010531","mag":"2137653883"},"language":"en","primary_location":{"id":"doi:10.1137/15m1010531","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1010531","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-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/A5028076811","display_name":"Jens Vygen","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jens Vygen","raw_affiliation_strings":["University of Bonn"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bonn","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028076811"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":null,"apc_paid":null,"fwci":4.5654,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.94671028,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"30","issue":"2","first_page":"875","last_page":"894"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9994000196456909,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8539010882377625},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7543398141860962},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7249391078948975},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7032527923583984},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.6636808514595032},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6443402767181396},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5316242575645447},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5208978652954102},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5166993141174316},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4902839958667755},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47932183742523193},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4767873287200928},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47019943594932556},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.46253612637519836},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4484364092350006},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4476701617240906},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.42880862951278687},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39481693506240845},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32194966077804565},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.29295629262924194},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.28333601355552673},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.21722543239593506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20978254079818726},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.13320162892341614}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8539010882377625},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7543398141860962},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7249391078948975},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7032527923583984},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.6636808514595032},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6443402767181396},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5316242575645447},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5208978652954102},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5166993141174316},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4902839958667755},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47932183742523193},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4767873287200928},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47019943594932556},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.46253612637519836},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4484364092350006},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4476701617240906},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.42880862951278687},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39481693506240845},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32194966077804565},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.29295629262924194},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.28333601355552673},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.21722543239593506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20978254079818726},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.13320162892341614},{"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/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/15m1010531","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1010531","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1714357736","https://openalex.org/W1965608008","https://openalex.org/W1971797008","https://openalex.org/W1983002996","https://openalex.org/W1999799345","https://openalex.org/W2009803313","https://openalex.org/W2012329067","https://openalex.org/W2038652993","https://openalex.org/W2043916130","https://openalex.org/W2058937865","https://openalex.org/W2064284095","https://openalex.org/W2081444009","https://openalex.org/W2107547393","https://openalex.org/W2136400551","https://openalex.org/W2162750432","https://openalex.org/W2240814884","https://openalex.org/W2399100674","https://openalex.org/W2765549233","https://openalex.org/W2802283659","https://openalex.org/W2950432526","https://openalex.org/W2951490424","https://openalex.org/W3151867035"],"related_works":["https://openalex.org/W3016811403","https://openalex.org/W2943635264","https://openalex.org/W1561849181","https://openalex.org/W2390742649","https://openalex.org/W2381121915","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2387385213","https://openalex.org/W3081212354","https://openalex.org/W2589768050"],"abstract_inverted_index":{"Many":[0],"recent":[1],"approximation":[2,68,133],"algorithms":[3],"for":[4,116],"different":[5],"variants":[6],"of":[7,25,37,102,135],"the":[8,19,26,57,91,114,117],"traveling":[9],"salesman":[10],"problem":[11],"(asymmetric":[12],"TSP,":[13,15],"graph":[14],"$s$-$t$-path":[16,119],"TSP)":[17],"exploit":[18],"well-known":[20],"fact":[21],"that":[22,45,84,127],"a":[23,48,52,60,66,73,100,123],"solution":[24],"natural":[27],"linear":[28],"programming":[29],"relaxation":[30],"can":[31,88,105],"be":[32],"written":[33],"as":[34],"convex":[35],"combination":[36],"spanning":[38,76,92,103],"trees.":[39],"The":[40],"main":[41],"argument":[42],"then":[43,55],"is":[44],"randomly":[46],"sampling":[47],"tree":[49,58,77],"from":[50],"such":[51],"distribution":[53],"and":[54],"completing":[56],"to":[59],"tour":[61],"at":[62],"minimum":[63,74],"cost":[64,75],"yields":[65],"better":[67],"guarantee":[69],"than":[70],"simply":[71],"taking":[72],"(as":[78],"in":[79,99],"Christofides'":[80],"algorithm).":[81],"We":[82,112],"argue":[83],"an":[85],"additional":[86],"step":[87],"help:":[89],"reassembling":[90],"trees":[93,104],"before":[94],"sampling.":[95],"Exchanging":[96],"two":[97],"edges":[98],"pair":[101],"improve":[106],"their":[107],"properties":[108],"under":[109],"certain":[110],"conditions.":[111],"demonstrate":[113],"usefulness":[115],"metric":[118],"TSP":[120],"by":[121],"devising":[122],"deterministic":[124],"polynomial-time":[125],"algorithm":[126],"improves":[128],"on":[129],"Seb\u00f6's":[130],"previously":[131],"best":[132],"ratio":[134],"$\\frac{8}{5}$.":[136]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}