{"id":"https://openalex.org/W2168155808","doi":"https://doi.org/10.1137/s0097539797320281","title":"On the Maximum Scatter Traveling Salesperson Problem","display_name":"On the Maximum Scatter Traveling Salesperson Problem","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2168155808","doi":"https://doi.org/10.1137/s0097539797320281","mag":"2168155808"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539797320281","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797320281","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5037943415","display_name":"Esther M. Arkin","orcid":"https://orcid.org/0009-0005-8542-931X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Esther M. Arkin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070100758","display_name":"Yi\u2010Jen Chiang","orcid":"https://orcid.org/0000-0001-7822-6200"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yi-Jen Chiang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015247956","display_name":"Joseph S. B. Mitchell","orcid":"https://orcid.org/0000-0002-0152-2279"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph S. B. Mitchell","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060741187","display_name":"Steven Skiena","orcid":"https://orcid.org/0000-0003-0397-7514"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Steven S. Skiena","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5112119748","display_name":"Tae-Cheon Yang","orcid":"https://orcid.org/0000-0002-6999-2269"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tae-Cheon Yang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5037943415"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.27298714,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"29","issue":"2","first_page":"515","last_page":"544"},"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.9994999766349792,"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.9994999766349792,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/hamiltonian-path","display_name":"Hamiltonian path","score":0.8035171031951904},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8004334568977356},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.7055158019065857},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6200647950172424},{"id":"https://openalex.org/keywords/successor-cardinal","display_name":"Successor cardinal","score":0.6131759285926819},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5577380061149597},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49560511112213135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4536539614200592},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43891507387161255},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4214867353439331},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.41441529989242554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39475017786026},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30785220861434937},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13537254929542542}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.8035171031951904},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8004334568977356},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7055158019065857},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6200647950172424},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.6131759285926819},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5577380061149597},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49560511112213135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4536539614200592},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43891507387161255},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4214867353439331},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.41441529989242554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39475017786026},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30785220861434937},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13537254929542542},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539797320281","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797320281","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1504514920","https://openalex.org/W1508325738","https://openalex.org/W1656332081","https://openalex.org/W1758509893","https://openalex.org/W1969154407","https://openalex.org/W1971367602","https://openalex.org/W1985376214","https://openalex.org/W1993525660","https://openalex.org/W2008292658","https://openalex.org/W2049310936","https://openalex.org/W2052817264","https://openalex.org/W2063292248","https://openalex.org/W2068872374","https://openalex.org/W2083580384","https://openalex.org/W2102403605","https://openalex.org/W2140787410","https://openalex.org/W2157529519","https://openalex.org/W2183207849","https://openalex.org/W2324108981","https://openalex.org/W4255224584"],"related_works":["https://openalex.org/W4241541331","https://openalex.org/W1618127724","https://openalex.org/W2016168023","https://openalex.org/W2259723333","https://openalex.org/W185619668","https://openalex.org/W1002323541","https://openalex.org/W2036803675","https://openalex.org/W2768859505","https://openalex.org/W2256329187","https://openalex.org/W4387272283"],"abstract_inverted_index":{"We":[0],"study":[1,67],"the":[2,21,26,41,64,89,99,135],"problem":[3,35,101],"of":[4,15,53,68,108],"computing":[5],"a":[6,13,104,114],"Hamiltonian":[7],"tour":[8,27,115,136],"(cycle)":[9],"or":[10,28,116,137],"path":[11,117],"on":[12,113],"set":[14],"points":[16,112],"in":[17,25,49,94,110],"order":[18],"to":[19,40,85,102],"maximize":[20],"minimum":[22],"edge":[23],"length":[24],"path.":[29,138],"This":[30],"\"maximum":[31],"scatter\"":[32],"traveling":[33],"salesperson":[34],"(TSP)":[36],"is":[37,45],"closely":[38],"related":[39],"bottleneck":[42],"TSP":[43],"and":[44,56,76,127],"motivated":[46],"by":[47],"applications":[48],"manufacturing":[50],"(e.g.,":[51],"sequencing":[52],"rivet":[54],"operations)":[55],"medical":[57],"imaging.":[58],"In":[59,82],"this":[60],"paper,":[61],"we":[62,96],"give":[63],"first":[65],"algorithmic":[66],"these":[69],"problems,":[70],"including":[71],"complexity":[72],"results,":[73],"approximation":[74],"algorithms,":[75],"exact":[77],"algorithms":[78],"for":[79],"special":[80],"cases.":[81],"an":[83],"attempt":[84],"model":[86],"more":[87,105],"accurately":[88],"real":[90],"problems":[91],"that":[92],"arise":[93],"practice,":[95],"also":[97,130],"generalize":[98],"basic":[100],"consider":[103],"general":[106],"measure":[107],"\"scatter\"":[109],"which":[111],"should":[118],"be":[119],"far":[120],"not":[121],"only":[122],"from":[123,131],"their":[124],"immediate":[125],"predecessor":[126],"successor,":[128],"but":[129],"other":[132],"near-neighbors":[133],"along":[134]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}