{"id":"https://openalex.org/W2113939799","doi":"https://doi.org/10.1137/050645464","title":"Approximation Algorithms for Orienteering and Discounted-Reward TSP","display_name":"Approximation Algorithms for Orienteering and Discounted-Reward TSP","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2113939799","doi":"https://doi.org/10.1137/050645464","mag":"2113939799"},"language":"en","primary_location":{"id":"doi:10.1137/050645464","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050645464","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/A5024803432","display_name":"Avrim Blum","orcid":"https://orcid.org/0000-0003-2450-5102"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Avrim Blum","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005407267","display_name":"Shuchi Chawla","orcid":"https://orcid.org/0000-0001-5583-2320"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shuchi Chawla","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David R. Karger","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020376623","display_name":"Terran Lane","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Terran Lane","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Adam Meyerson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Adam Meyerson","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5061162461","display_name":"Maria Minkoff","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maria Minkoff","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5024803432"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.4051,"has_fulltext":false,"cited_by_count":196,"citation_normalized_percentile":{"value":0.97319495,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"37","issue":"2","first_page":"653","last_page":"670"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/orienteering","display_name":"Orienteering","score":0.8409366011619568},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5091404318809509},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4965735077857971},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48668938875198364},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4555240571498871},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4529624283313751},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37850844860076904}],"concepts":[{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.8409366011619568},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5091404318809509},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4965735077857971},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48668938875198364},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4555240571498871},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4529624283313751},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37850844860076904}],"mesh":[],"locations_count":12,"locations":[{"id":"doi:10.1137/050645464","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050645464","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:repository.cmu.edu:compsci-1162","is_oa":false,"landing_page_url":"http://repository.cmu.edu/compsci/176","pdf_url":null,"source":{"id":"https://openalex.org/S4306400668","display_name":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department","raw_type":"text"},{"id":"pmh:doi:10.1184/r1/6603608","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":null,"raw_type":"Journal contribution"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.7261","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.7261","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-2.cs.cmu.edu/~avrim/Papers/orienteering.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.8941","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.8941","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.wisc.edu/~shuchi/papers/orienteeringFOCS.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.138.4858","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.4858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.wisc.edu/~shuchi/papers/orienteeringFOCS.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.387.3500","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.3500","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/karger/Papers/markovTSP.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.387.4805","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.4805","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/karger/Papers/orienteering-sicomp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.421.2904","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.2904","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucla.edu/~awm/papers/orienteering.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.61.1866","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.1866","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~avrim/Papers/orienteering.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.646.7052","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.7052","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.7841","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.7841","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://reports-archive.adm.cs.cmu.edu/anon/2003/CMU-CS-03-121.ps","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":7,"referenced_works":["https://openalex.org/W1575625195","https://openalex.org/W1986056047","https://openalex.org/W1998678640","https://openalex.org/W2001139415","https://openalex.org/W2003281104","https://openalex.org/W2044119054","https://openalex.org/W2107726111"],"related_works":["https://openalex.org/W2135447820","https://openalex.org/W3123132404","https://openalex.org/W2166978121","https://openalex.org/W2584814407","https://openalex.org/W2308371765","https://openalex.org/W2031321347","https://openalex.org/W1826457205","https://openalex.org/W4213005497","https://openalex.org/W2004604480","https://openalex.org/W3175646847"],"abstract_inverted_index":{"In":[0,34,55,86],"this":[1],"paper,":[2],"we":[3,22,37,95],"give":[4],"the":[5,11,24,56,59,71,80,84,87,103,108,114,139,146,202,230,240,248,252,272,309],"first":[6,249],"constant-factor":[7],"approximation":[8,133,156,302],"algorithm":[9],"for":[10,116,181,197,222,304],"rooted":[12,253],"Orienteering":[13,57,204,305],"problem,":[14,58,205],"as":[15,17,180,199,226],"well":[16],"a":[18,40,51,64,76,92,98,117,135,159],"new":[19],"problem":[20,28,128,137,258,310],"that":[21,69,168,308],"call":[23],"Discounted-Reward":[25,88],"traveling":[26],"salesman":[27],"(TSP),":[29],"motivated":[30,130],"by":[31,125,131,306],"robot":[32],"navigation.":[33],"both":[35],"problems,":[36],"are":[38,96],"given":[39,97],"graph":[41],"with":[42,163],"lengths":[43],"on":[44,48,79,276],"edges":[45],"and":[46,50,102,176,188,194,239,267,282,289],"rewards":[47,178],"nodes,":[49],"start":[52,211],"node":[53,118,212],"s.":[54],"goal":[60,104],"is":[61,105,123,129,208,237,243,247,311],"to":[62,75,106,134,161,172,217,234,250],"find":[63],"path":[65],"starting":[66],"at":[67,120],"s":[68],"maximizes":[70],"reward":[72,111,115,152,233],"collected,":[73,112],"subject":[74],"hard":[77],"limit":[78,94],"total":[81,109,241],"length":[82,93,242],"of":[83,91,191,232,271],"path.":[85],"TSP,":[89],"instead":[90],"discount":[99],"factor":[100],"$\\gamma$,":[101],"maximize":[107],"discounted":[110,124,151],"where":[113,206],"reached":[119],"time":[121],"t":[122],"$\\gamma^t$.":[126],"This":[127],"an":[132,256],"planning":[136],"in":[138,259],"Markov":[140],"decision":[141],"process":[142],"(MDP)":[143],"framework":[144],"under":[145],"commonly":[147],"employed":[148],"infinite":[149],"horizon":[150],"optimality":[153],"criterion.":[154],"The":[155],"arises":[157],"from":[158],"need":[160],"deal":[162],"exponentially":[164],"large":[165],"state":[166],"spaces":[167],"emerge":[169],"when":[170],"trying":[171],"model":[173],"one-time":[174],"events":[175],"nonrepeatable":[177],"(such":[179],"package":[182],"deliveries).":[183],"We":[184,299],"also":[185],"consider":[186],"tree":[187],"multiple-path":[189],"variants":[190],"these":[192],"problems":[193,224],"provide":[195],"approximations":[196],"those":[198],"well.":[200],"Although":[201],"unrooted":[203],"there":[207],"no":[209],"fixed":[210,238],"s,":[213],"has":[214],"been":[215],"known":[216],"be":[218,235],"approximable":[219],"using":[220],"algorithms":[221],"related":[223],"such":[225],"k-TSP":[227],"(in":[228],"which":[229],"amount":[231],"collected":[236],"approximately":[244],"minimized),":[245],"ours":[246],"approximate":[251],"question,":[254],"solving":[255],"open":[257],"[E.":[260],"M.":[261],"Arkin,":[262],"J.":[263,293],"S.":[264,290],"B.":[265],"Mitchell,":[266],"G.":[268],"Narasimhan,":[269],"Proceedings":[270],"$14$th":[273],"ACM":[274],"Symposium":[275],"Computational":[277],"Geometry,":[278],"1998,":[279],"pp.":[280,297],"307\u2013316]":[281],"[B.":[283],"Awerbuch,":[284],"Y.":[285],"Azar,":[286],"A.":[287],"Blum,":[288],"Vempala,":[291],"SIAM":[292],"Comput.,":[294],"28":[295],"(1998),":[296],"254\u2013262].":[298],"complement":[300],"our":[301],"result":[303],"showing":[307],"APX-hard.":[312]},"counts_by_year":[{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":18},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":19},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}