{"id":"https://openalex.org/W2037666581","doi":"https://doi.org/10.1137/060667839","title":"The Euclidean Orienteering Problem Revisited","display_name":"The Euclidean Orienteering Problem Revisited","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2037666581","doi":"https://doi.org/10.1137/060667839","mag":"2037666581"},"language":"en","primary_location":{"id":"doi:10.1137/060667839","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060667839","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/A5100451971","display_name":"Ke Chen","orcid":"https://orcid.org/0000-0001-5470-6621"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ke Chen","raw_affiliation_strings":["[email\u00a0protected] and http://www.uiuc.edu/$\\\\!_{^{\\\\sim}}\\\\!$kechen and [email\u00a0protected] and http://www.uiuc.edu/ $\\\\!_{^{\\\\sim}}\\\\!$sariel#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[email\u00a0protected] and http://www.uiuc.edu/$\\\\!_{^{\\\\sim}}\\\\!$kechen and [email\u00a0protected] and http://www.uiuc.edu/ $\\\\!_{^{\\\\sim}}\\\\!$sariel#TAB#","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040577923","display_name":"Sariel Har-Peled","orcid":"https://orcid.org/0000-0003-2638-9635"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sariel Har-Peled","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.4484,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.93567251,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"38","issue":"1","first_page":"385","last_page":"397"},"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.9984999895095825,"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.9984999895095825,"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/T12176","display_name":"Optimization and Packing Problems","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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9886000156402588,"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/orienteering","display_name":"Orienteering","score":0.9250682592391968},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5890881419181824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4913147985935211},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4887533187866211},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44030967354774475},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2683725357055664},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.15703189373016357}],"concepts":[{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.9250682592391968},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5890881419181824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4913147985935211},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4887533187866211},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44030967354774475},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2683725357055664},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.15703189373016357}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/060667839","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060667839","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.92.5979","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.5979","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://valis.cs.uiuc.edu/~sariel/papers/05/orient/orienteering.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1520111182","https://openalex.org/W1559701472","https://openalex.org/W1601649239","https://openalex.org/W1991678853","https://openalex.org/W1994248285","https://openalex.org/W2038190710","https://openalex.org/W2068752469","https://openalex.org/W2072592433","https://openalex.org/W2110367141","https://openalex.org/W2148026779","https://openalex.org/W2151239055","https://openalex.org/W2158591664","https://openalex.org/W2165142526"],"related_works":["https://openalex.org/W1978042415","https://openalex.org/W3086542228","https://openalex.org/W2017331178","https://openalex.org/W2976797620","https://openalex.org/W2963026025","https://openalex.org/W2963196951","https://openalex.org/W2552783079","https://openalex.org/W3117705332","https://openalex.org/W2108371780","https://openalex.org/W3009541666"],"abstract_inverted_index":{"We":[0,51],"consider":[1],"the":[2,14,64,78,89],"rooted":[3],"orienteering":[4],"problem:":[5],"Given":[6],"a":[7,16,23,31,53],"set":[8],"P":[9,42],"of":[10,41,46,73,80],"n":[11],"points":[12,40,72,81],"in":[13,61,102],"plane,":[15],"starting":[17,33],"point":[18],"$r":[19],"\\in":[20],"P$,":[21],"and":[22,45],"length":[24,47],"constraint":[25],"B,":[26],"one":[27],"needs":[28],"to":[29],"find":[30],"path":[32,66],"from":[34],"r":[35],"that":[36,59],"visits":[37,67],"as":[38,43],"many":[39],"possible":[44],"not":[48],"exceeding":[49],"B.":[50],"present":[52],"$(1-\\varepsilon)$-approximation":[54],"algorithm":[55,99],"for":[56,95],"this":[57,96],"problem":[58],"runs":[60],"$n^{O(1/\\varepsilon)}$":[62],"time;":[63],"computed":[65],"at":[68],"least":[69],"$":[70],"(1-\\varepsilon)k_{\\mathrm{opt}}$":[71],"P,":[74],"where":[75],"$k_{\\mathrm{opt}}$":[76],"is":[77,88],"number":[79],"visited":[82],"by":[83],"an":[84],"optimal":[85],"solution.":[86],"This":[87],"first":[90],"polynomial":[91],"time":[92],"approximation":[93],"scheme":[94],"problem.":[97],"The":[98],"also":[100],"works":[101],"higher":[103],"dimensions.":[104]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}