{"id":"https://openalex.org/W2046982002","doi":"https://doi.org/10.1137/s0097539796312721","title":"The Angular-Metric Traveling Salesman Problem","display_name":"The Angular-Metric Traveling Salesman Problem","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2046982002","doi":"https://doi.org/10.1137/s0097539796312721","mag":"2046982002"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539796312721","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796312721","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/A5034238598","display_name":"Alok Aggarwal","orcid":"https://orcid.org/0000-0002-4394-4488"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alok Aggarwal","raw_affiliation_strings":["IBM, ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM, ,","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067588072","display_name":"Don Coppersmith","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Don Coppersmith","raw_affiliation_strings":["IBM, ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM, ,","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689"},"institutions":[{"id":"https://openalex.org/I1322087612","display_name":"Alcatel Lucent (Germany)","ror":"https://ror.org/00c5mwp75","country_code":"DE","type":"company","lineage":["https://openalex.org/I1322087612"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":["Lucent"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lucent","institution_ids":["https://openalex.org/I1322087612"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112649653","display_name":"Rajeev Motwani","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajeev Motwani","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Baruch Schieber","raw_affiliation_strings":["IBM, ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM, ,","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7712,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":{"value":0.77069504,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"29","issue":"3","first_page":"697","last_page":"711"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9987999796867371,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9979000091552734,"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.751325249671936},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.702564537525177},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6062967777252197},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.6014406085014343},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5733200907707214},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5515482425689697},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5426110029220581},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5408696532249451},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5406174063682556},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5238152146339417},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5096259117126465},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47958794236183167},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4665071368217468},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4660196304321289},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46142321825027466},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3725816607475281},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.30440646409988403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21859705448150635},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12403875589370728}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.751325249671936},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.702564537525177},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6062967777252197},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.6014406085014343},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5733200907707214},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5515482425689697},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5426110029220581},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5408696532249451},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5406174063682556},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5238152146339417},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5096259117126465},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47958794236183167},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4665071368217468},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4660196304321289},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46142321825027466},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3725816607475281},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.30440646409988403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21859705448150635},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12403875589370728},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539796312721","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796312721","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":5,"referenced_works":["https://openalex.org/W2047901468","https://openalex.org/W2052562833","https://openalex.org/W2058786336","https://openalex.org/W2059435624","https://openalex.org/W2071120094"],"related_works":["https://openalex.org/W4376138746","https://openalex.org/W2361554335","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2044119054","https://openalex.org/W2184834902","https://openalex.org/W2241463327","https://openalex.org/W2183097989","https://openalex.org/W2038458261","https://openalex.org/W1579502333"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"applications":[2],"in":[3,24,87],"robotics,":[4],"we":[5,114,134,153],"formulate":[6],"the":[7,11,28,35,38,42,46,56,63,93,99,102,111,119,122,131,136,140,158],"problem":[8,51,94],"of":[9,15,22,31,37,48,65,84,95,121,139],"minimizing":[10],"total":[12],"angle":[13,29,100,141],"cost":[14,30],"a":[16,20,32,82,106],"TSP":[17,107],"tour":[18,33],"for":[19,69,105,148],"set":[21],"points":[23],"Euclidean":[25],"space,":[26],"where":[27],"is":[34],"sum":[36,120],"direction":[39],"changes":[40],"at":[41],"points.":[43],"We":[44,60,90],"establish":[45],"NP-hardness":[47],"both":[49,75,98],"this":[50,151],"and":[52,72,101,126,143],"its":[53],"relaxation":[54],"to":[55,80,116,157,168],"cycle":[57],"cover":[58],"problem.":[59],"then":[61],"consider":[62,92,135],"issue":[64],"designing":[66],"approximation":[67],"algorithms":[68],"these":[70],"problems":[71,76],"show":[73],"that":[74],"can":[77],"be":[78],"approximated":[79],"within":[81],"ratio":[83],"O(log":[85],"n)":[86],"polynomial":[88],"time.":[89],"also":[91],"simultaneously":[96],"approximating":[97],"length":[103],"measure":[104,142],"tour.":[108],"In":[109,150],"studying":[110],"resulting":[112],"tradeoff,":[113],"choose":[115],"focus":[117],"on":[118,130],"two":[123],"performance":[124],"ratios":[125],"provide":[127],"tight":[128,146],"bounds":[129,147],"sum.":[132],"Finally,":[133],"extremal":[137],"value":[138],"obtain":[144],"essentially":[145],"it.":[149],"paper":[152],"restrict":[154],"our":[155,163],"attention":[156],"planar":[159],"setting,":[160],"but":[161],"all":[162],"results":[164],"are":[165],"easily":[166],"extended":[167],"higher":[169],"dimensions.":[170]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}