{"id":"https://openalex.org/W1564606675","doi":"https://doi.org/10.1007/3-540-45535-3_32","title":"Approximation Algorithms for the Minimum Bends Traveling Salesman Problem","display_name":"Approximation Algorithms for the Minimum Bends Traveling Salesman Problem","publication_year":2010,"publication_date":"2010-02-11","ids":{"openalex":"https://openalex.org/W1564606675","doi":"https://doi.org/10.1007/3-540-45535-3_32","mag":"1564606675"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45535-3_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45535-3_32","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5054641291","display_name":"Clifford Stein","orcid":"https://orcid.org/0000-0002-0614-6620"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Clifford Stein","raw_affiliation_strings":["Dartmouth College, Department of Computer Science, Hanover, NH 03755-3510, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dartmouth College, Department of Computer Science, Hanover, NH 03755-3510, Germany","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108245092","display_name":"David P. Wagner","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David P. Wagner*","raw_affiliation_strings":["Dartmouth College, Department of Computer Science, Hanover, NH 03755-3510, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dartmouth College, Department of Computer Science, Hanover, NH 03755-3510, Germany","institution_ids":["https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I107672454"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.3803,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.87307949,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"406","last_page":"421"},"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.9977999925613403,"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.9977999925613403,"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.9969000220298767,"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.9968000054359436,"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.8088704347610474},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6225655674934387},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5657116174697876},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5449066162109375},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5157792568206787},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.49683263897895813},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4922875463962555},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48839205503463745},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.477500855922699},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.44934993982315063},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.44799157977104187},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.427865207195282},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42388883233070374},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36051785945892334},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09811362624168396},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09655743837356567}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8088704347610474},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6225655674934387},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5657116174697876},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5449066162109375},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5157792568206787},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.49683263897895813},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4922875463962555},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48839205503463745},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.477500855922699},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.44934993982315063},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.44799157977104187},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.427865207195282},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42388883233070374},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36051785945892334},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09811362624168396},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09655743837356567},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-45535-3_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45535-3_32","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W80909727","https://openalex.org/W1508325738","https://openalex.org/W1537994124","https://openalex.org/W1966793805","https://openalex.org/W1980328919","https://openalex.org/W1982991648","https://openalex.org/W1994248285","https://openalex.org/W2022671649","https://openalex.org/W2027402472","https://openalex.org/W2033530135","https://openalex.org/W2044060832","https://openalex.org/W2046982002","https://openalex.org/W2049310936","https://openalex.org/W2051045196","https://openalex.org/W2051535840","https://openalex.org/W2054630393","https://openalex.org/W2067943142","https://openalex.org/W2069657003","https://openalex.org/W2102403605","https://openalex.org/W2103772568","https://openalex.org/W2107735380","https://openalex.org/W2119430004","https://openalex.org/W2126353399","https://openalex.org/W2139648082","https://openalex.org/W2157054705","https://openalex.org/W2163030926","https://openalex.org/W2165142526","https://openalex.org/W2172285784"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W2361554335","https://openalex.org/W1595757466","https://openalex.org/W2362402143","https://openalex.org/W2073288620","https://openalex.org/W2356976268","https://openalex.org/W2334181621"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}