{"id":"https://openalex.org/W2141596881","doi":"https://doi.org/10.1145/2151171.2151180","title":"On approximating multicriteria TSP","display_name":"On approximating multicriteria TSP","publication_year":2012,"publication_date":"2012-04-01","ids":{"openalex":"https://openalex.org/W2141596881","doi":"https://doi.org/10.1145/2151171.2151180","mag":"2141596881"},"language":"en","primary_location":{"id":"doi:10.1145/2151171.2151180","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2151171.2151180","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5002315999","display_name":"Bodo Manthey","orcid":"https://orcid.org/0000-0001-6278-5059"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Bodo Manthey","raw_affiliation_strings":["University of Twente, The Netherlands","University of Twente, The Netherlands,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Twente, The Netherlands","institution_ids":["https://openalex.org/I94624287"]},{"raw_affiliation_string":"University of Twente, The Netherlands,","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5002315999"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":null,"apc_paid":null,"fwci":1.8153,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86752731,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"2","first_page":"1","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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.998199999332428,"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.8601614236831665},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6766526699066162},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6677777767181396},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.6100297570228577},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.5980295538902283},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5007686614990234},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.461132675409317},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4451099932193756},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3319436311721802},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.29418468475341797},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27916592359542847},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10693725943565369}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8601614236831665},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6766526699066162},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6677777767181396},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.6100297570228577},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.5980295538902283},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5007686614990234},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.461132675409317},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4451099932193756},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3319436311721802},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.29418468475341797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27916592359542847},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10693725943565369}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2151171.2151180","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2151171.2151180","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/fb1f9889-aa5d-47c1-a579-8cf71aaaf018","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/fb1f9889-aa5d-47c1-a579-8cf71aaaf018","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Manthey, B 2012, 'On approximating multi-criteria TSP', ACM transactions on algorithms, vol. 8, no. 2, 17, pp. 17:1-17:18. https://doi.org/10.1145/2151171.2151180","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:publications/fb541e2f-fe89-4b09-894e-b499674a7578","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320324516","display_name":"Southern Taiwan Science Park","ror":"https://ror.org/059e60q69"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1500758801","https://openalex.org/W1510410993","https://openalex.org/W1519748196","https://openalex.org/W1576317141","https://openalex.org/W1902458947","https://openalex.org/W1928381443","https://openalex.org/W1963770385","https://openalex.org/W1977545325","https://openalex.org/W2019570365","https://openalex.org/W2033501672","https://openalex.org/W2035610952","https://openalex.org/W2051080684","https://openalex.org/W2056215713","https://openalex.org/W2056547933","https://openalex.org/W2069381123","https://openalex.org/W2081444009","https://openalex.org/W2083743691","https://openalex.org/W2103012681","https://openalex.org/W2137717103","https://openalex.org/W2167197687","https://openalex.org/W2338905098","https://openalex.org/W2615258659","https://openalex.org/W2744355553","https://openalex.org/W3021112015","https://openalex.org/W3121437753","https://openalex.org/W4233413206","https://openalex.org/W4241708030","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W562960941","https://openalex.org/W2766731260","https://openalex.org/W2554237698","https://openalex.org/W3210931532","https://openalex.org/W2038858023","https://openalex.org/W2025698306","https://openalex.org/W1481223916","https://openalex.org/W2953214908","https://openalex.org/W4302811897","https://openalex.org/W2744355553"],"abstract_inverted_index":{"We":[0],"present":[1,62,84,100],"approximation":[2,19,45,94,103],"algorithms":[3,20,73],"for":[4,21,75,88,105],"almost":[5],"all":[6],"variants":[7],"of":[8,47,68,80,96,120],"the":[9,32,55,106],"multicriteria":[10,22,29,52,108],"traveling":[11,24],"salesman":[12,25],"problem":[13],"(TSP).":[14],"First,":[15],"we":[16,39,61,83,99],"devise":[17,40],"randomized":[18,102],"maximum":[23],"problems":[26],"(Max-TSP).":[27],"For":[28,51],"Max-STSP":[30,90],"where":[31,54],"edge":[33,56],"weights":[34,57],"have":[35],"to":[36],"be":[37,59],"symmetric,":[38],"an":[41,44,63,93],"algorithm":[42,64,87,104,116],"with":[43,65,111],"ratio":[46,67,95,119],"2/3":[48],"-":[49,70],"\u03b5.":[50,71,124],"Max-ATSP":[53],"may":[58],"asymmetric,":[60],"a":[66,85,101,118],"1/2":[69],"Our":[72],"work":[74],"any":[76],"fixed":[77],"number":[78],"k":[79],"objectives.":[81],"Furthermore,":[82],"deterministic":[86],"bicriteria":[89],"that":[91],"achieves":[92,117],"7/27.":[97],"Finally,":[98],"asymmetric":[107],"minimum":[109],"TSP":[110],"triangle":[112],"inequality":[113],"(Min-ATSP).":[114],"This":[115],"log":[121],"n":[122],"+":[123]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}