{"id":"https://openalex.org/W2127473933","doi":"https://doi.org/10.1142/s0218195904001342","title":"TRAVELING SALESMAN PROBLEM OF SEGMENTS","display_name":"TRAVELING SALESMAN PROBLEM OF SEGMENTS","publication_year":2004,"publication_date":"2004-04-01","ids":{"openalex":"https://openalex.org/W2127473933","doi":"https://doi.org/10.1142/s0218195904001342","mag":"2127473933"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195904001342","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195904001342","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","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/A5006945148","display_name":"Jinhui Xu","orcid":"https://orcid.org/0000-0001-5730-9429"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"JINHUI XU","raw_affiliation_strings":["Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY 14260, USA","Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY, 14260, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY 14260, USA","institution_ids":["https://openalex.org/I63190737"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY, 14260, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108577883","display_name":"Zhiyong Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ZHIYONG LIN","raw_affiliation_strings":["Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY 14260, USA","Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY, 14260, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY 14260, USA","institution_ids":["https://openalex.org/I63190737"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY, 14260, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100397622","display_name":"Yang Yang","orcid":"https://orcid.org/0000-0002-5241-5203"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"YANG YANG","raw_affiliation_strings":["Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY 14260, USA","Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY, 14260, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY 14260, USA","institution_ids":["https://openalex.org/I63190737"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY, 14260, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011131850","display_name":"Ronald Berezney","orcid":null},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"RONALD BEREZNEY","raw_affiliation_strings":["Department of Biological Sciences,  State University of New York at Buffalo, Buffalo, NY 14260, USA","Department of Biological Sciences, State University of New York at Buffalo, Buffalo, NY 14260, USA,"],"affiliations":[{"raw_affiliation_string":"Department of Biological Sciences,  State University of New York at Buffalo, Buffalo, NY 14260, USA","institution_ids":["https://openalex.org/I63190737"]},{"raw_affiliation_string":"Department of Biological Sciences, State University of New York at Buffalo, Buffalo, NY 14260, USA,","institution_ids":["https://openalex.org/I63190737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5006945148"],"corresponding_institution_ids":["https://openalex.org/I63190737"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.16315678,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"01n02","first_page":"19","last_page":"40"},"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.9969000220298767,"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.9969000220298767,"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/T11106","display_name":"Data Management and Algorithms","score":0.9965999722480774,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9955999851226807,"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.9319267868995667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8187191486358643},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7073209881782532},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6426423192024231},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5176563858985901},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.49434399604797363},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.4892134666442871},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.48425576090812683},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4785219430923462},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46290716528892517},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4311392605304718},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.42872804403305054},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41773927211761475},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3267025947570801},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22213953733444214},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11737653613090515}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9319267868995667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8187191486358643},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7073209881782532},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6426423192024231},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5176563858985901},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.49434399604797363},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.4892134666442871},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.48425576090812683},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4785219430923462},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46290716528892517},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4311392605304718},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.42872804403305054},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41773927211761475},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3267025947570801},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22213953733444214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11737653613090515},{"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195904001342","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195904001342","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","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":12,"referenced_works":["https://openalex.org/W249091067","https://openalex.org/W1502134938","https://openalex.org/W1559701472","https://openalex.org/W1596059437","https://openalex.org/W1967317811","https://openalex.org/W1994248285","https://openalex.org/W2102076751","https://openalex.org/W2110824994","https://openalex.org/W2129159378","https://openalex.org/W2141355868","https://openalex.org/W2165142526","https://openalex.org/W2782764548"],"related_works":["https://openalex.org/W2946024655","https://openalex.org/W2141355868","https://openalex.org/W3013791021","https://openalex.org/W2758988501","https://openalex.org/W2099174039","https://openalex.org/W4246557197","https://openalex.org/W4294358747","https://openalex.org/W2572756133","https://openalex.org/W2146364482","https://openalex.org/W1604040598"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"a":[5,12,24,32,65,75,98],"polynomial":[6],"time":[7,95],"approximation":[8],"scheme":[9],"(PTAS)":[10],"for":[11,71],"variant":[13],"of":[14,34,56,67,77,82,111],"the":[15,53],"traveling":[16,25],"salesman":[17,26],"problem":[18],"(called":[19],"segment":[20],"TSP)":[21],"in":[22,38,59],"which":[23,51],"tour":[27,63],"is":[28],"sought":[29],"to":[30,96],"traverse":[31],"set":[33,76],"n":[35],"\u220a-separated":[36],"segments":[37],"two":[39],"dimensional":[40],"space.":[41],"Our":[42],"results":[43],"are":[44],"based":[45],"on":[46],"an":[47,60,108],"interesting":[48],"combinatorial":[49],"result":[50],"bounds":[52],"total":[54],"number":[55],"entry":[57],"points":[58],"optimal":[61],"TSP":[62,73],"and":[64,103],"generalization":[66],"Arora's":[68],"technique":[69],"5":[70],"Euclidean":[72],"(of":[74],"points).":[78],"The":[79],"randomized":[80],"version":[81],"our":[83],"algorithm":[84],"takes":[85],"O(n":[86,112],"2":[87,92,113],"(":[88],"log":[89],"n)":[90],"O(1/\u220a":[91],")":[93,94],"compute":[97],"(1+\u220a)-approximation":[99],"with":[100,107],"probability":[101],"\u2265l/2,":[102],"can":[104],"be":[105],"derandomized":[106],"additional":[109],"factor":[110],").":[114]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}