{"id":"https://openalex.org/W2098527118","doi":"https://doi.org/10.1142/s1793830912500449","title":"THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE","display_name":"THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE","publication_year":2012,"publication_date":"2012-09-25","ids":{"openalex":"https://openalex.org/W2098527118","doi":"https://doi.org/10.1142/s1793830912500449","mag":"2098527118"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830912500449","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830912500449","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and 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/A5091313409","display_name":"Adrian Dumitrescu","orcid":"https://orcid.org/0000-0002-1118-0321"},"institutions":[{"id":"https://openalex.org/I43579087","display_name":"University of Wisconsin\u2013Milwaukee","ror":"https://ror.org/031q21x57","country_code":"US","type":"education","lineage":["https://openalex.org/I43579087"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"ADRIAN DUMITRESCU","raw_affiliation_strings":["Department of Computer Science, University of Wisconsin\u2013Milwaukee, WI 53201-0784, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Wisconsin\u2013Milwaukee, WI 53201-0784, USA","institution_ids":["https://openalex.org/I43579087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091313409"],"corresponding_institution_ids":["https://openalex.org/I43579087"],"apc_list":null,"apc_paid":null,"fwci":2.1169,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.88761002,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"04","issue":"04","first_page":"1250044","last_page":"1250044"},"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.9998999834060669,"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.9998999834060669,"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.9973000288009644,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9958000183105469,"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.8105323314666748},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.7512357831001282},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6716487407684326},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6267787218093872},{"id":"https://openalex.org/keywords/perimeter","display_name":"Perimeter","score":0.6136967539787292},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5256532430648804},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5174992084503174},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5137451887130737},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4729672968387604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32768428325653076},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2852710485458374},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.17061901092529297},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07462301850318909}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8105323314666748},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.7512357831001282},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6716487407684326},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6267787218093872},{"id":"https://openalex.org/C98503990","wikidata":"https://www.wikidata.org/wiki/Q28474","display_name":"Perimeter","level":2,"score":0.6136967539787292},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5256532430648804},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5174992084503174},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5137451887130737},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4729672968387604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32768428325653076},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2852710485458374},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.17061901092529297},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07462301850318909},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830912500449","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830912500449","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8399999737739563,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1974433908","https://openalex.org/W1986642089","https://openalex.org/W1993058867","https://openalex.org/W2035400240","https://openalex.org/W2046670590","https://openalex.org/W2104800753","https://openalex.org/W2110824994","https://openalex.org/W2145459554","https://openalex.org/W3121675905"],"related_works":["https://openalex.org/W2488601361","https://openalex.org/W1977612671","https://openalex.org/W2242098268","https://openalex.org/W4244945894","https://openalex.org/W4235563942","https://openalex.org/W2760515006","https://openalex.org/W1970646112","https://openalex.org/W161398591","https://openalex.org/W205439767","https://openalex.org/W2757441600"],"abstract_inverted_index":{"In":[0,26],"the":[1,27,65,73],"Euclidean":[2],"TSP":[3],"with":[4,45],"neighborhoods":[5,55],"(TSPN),":[6],"we":[7,17,30,67],"are":[8,57],"given":[9],"a":[10,19,32,69,77],"collection":[11],"of":[12,54,76,83],"n":[13],"regions":[14],"(neighborhoods)":[15],"and":[16,60],"seek":[18,31],"shortest":[20,33],"tour":[21],"that":[22,35,56],"visits":[23,36],"each":[24,37],"region.":[25,38],"path":[28,34],"variant,":[29],"We":[39],"present":[40],"several":[41],"linear-time":[42],"approximation":[43],"algorithms":[44],"improved":[46],"ratios":[47],"for":[48,51],"these":[49],"problems":[50],"two":[52],"cases":[53],"(infinite)":[58],"lines,":[59],"respectively,":[61],"(half-infinite)":[62],"rays.":[63],"Along":[64],"way":[66],"derive":[68],"tight":[70],"bound":[71],"on":[72],"minimum":[74],"perimeter":[75],"rectangle":[78],"enclosing":[79],"an":[80],"open":[81],"curve":[82],"length":[84],"L.":[85]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}