{"id":"https://openalex.org/W2148026779","doi":"https://doi.org/10.1109/sfcs.2003.1238180","title":"Approximation algorithms for orienteering and discounted-reward TSP","display_name":"Approximation algorithms for orienteering and discounted-reward TSP","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W2148026779","doi":"https://doi.org/10.1109/sfcs.2003.1238180","mag":"2148026779"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2003.1238180","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238180","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},"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/A5024803432","display_name":"Avrim Blum","orcid":"https://orcid.org/0000-0003-2450-5102"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Blum","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005407267","display_name":"Shuchi Chawla","orcid":"https://orcid.org/0000-0001-5583-2320"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Chawla","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"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":"D.R. Karger","raw_affiliation_strings":["MIT Laboratory for Computer Science, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT Laboratory for Computer Science, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020376623","display_name":"Terran Lane","orcid":null},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. Lane","raw_affiliation_strings":["Department of Computer Science, University of New Mexico, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of New Mexico, USA","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113788789","display_name":"Adam Meyerson","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Meyerson","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061162461","display_name":"Maria Minkoff","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Minkoff","raw_affiliation_strings":["MIT Laboratory for Computer Science, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT Laboratory for Computer Science, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":176,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"46","last_page":"55"},"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.9575924277305603},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6615800261497498},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6203233599662781},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6150336265563965},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5525264739990234},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5265855193138123},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4990558624267578},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4581761062145233},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45609250664711},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44948631525039673},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.43980443477630615},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4289167821407318},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3765510320663452},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37326568365097046},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.28425925970077515},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1344435214996338}],"concepts":[{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.9575924277305603},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6615800261497498},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6203233599662781},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6150336265563965},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5525264739990234},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5265855193138123},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4990558624267578},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4581761062145233},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45609250664711},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44948631525039673},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.43980443477630615},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4289167821407318},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3765510320663452},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37326568365097046},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.28425925970077515},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1344435214996338},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sfcs.2003.1238180","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238180","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W94285304","https://openalex.org/W1482405521","https://openalex.org/W1521148214","https://openalex.org/W1575625195","https://openalex.org/W1576452626","https://openalex.org/W1986056047","https://openalex.org/W1989980743","https://openalex.org/W1998678640","https://openalex.org/W2001139415","https://openalex.org/W2003281104","https://openalex.org/W2043905543","https://openalex.org/W2044119054","https://openalex.org/W2068752469","https://openalex.org/W2098432798","https://openalex.org/W2107726111","https://openalex.org/W2112638680","https://openalex.org/W2115556222","https://openalex.org/W2121863487","https://openalex.org/W2150272096","https://openalex.org/W2158591664","https://openalex.org/W2334782222","https://openalex.org/W4214717370","https://openalex.org/W6661415368","https://openalex.org/W6682356983","https://openalex.org/W6922255115"],"related_works":["https://openalex.org/W4249387127","https://openalex.org/W1543810005","https://openalex.org/W4393610368","https://openalex.org/W4393731121","https://openalex.org/W327165017","https://openalex.org/W2356214734","https://openalex.org/W2394169628","https://openalex.org/W4254102998","https://openalex.org/W2381702286","https://openalex.org/W2622090745"],"abstract_inverted_index":{"In":[0,31,53,81],"this":[1],"paper,":[2],"we":[3,22,34,90,136],"give":[4],"the":[5,11,24,54,57,66,75,79,82,99,127,141,166,194,204,212,216],"first":[6,142,213],"constant-factor":[7],"approximation":[8],"algorithm":[9],"for":[10,110,161,186],"rooted":[12,217],"orienteering":[13,55,168],"problem,":[14,56,169],"as":[15,17,163,190],"well":[16],"a":[18,37,49,62,71,87,93,111,139,144],"new":[19],"problem":[20,222],"that":[21,64],"call":[23],"Discounted-Reward":[25,83],"TSP,":[26,84],"motivated":[27],"by":[28,119],"robot":[29],"navigation.":[30],"both":[32],"problems,":[33],"are":[35,91],"given":[36,92],"graph":[38],"with":[39],"lengths":[40],"on":[41,46,74,224],"edges":[42],"and":[43,48,98,152,158,203,230],"prizes":[44],"(rewards)":[45],"nodes,":[47],"start":[50,175],"node":[51,112,145,176],"s.":[52],"goal":[58,100],"is":[59,101,117,124,146,172,201,207,211],"to":[60,70,102,126,181,198,214],"find":[61],"path":[63],"maximizes":[65],"reward":[67,106,109,140,197],"collected,":[68,107],"subject":[69],"hard":[72],"limit":[73,89],"total":[76,104,205],"length":[77,88,206],"of":[78,86,155,196],"path.":[80],"instead":[85],"discount":[94],"factor":[95],"/spl":[96,120],"gamma/,":[97],"maximize":[103],"discounted":[105,118],"where":[108,170],"reached":[113],"at":[114],"time":[115,143],"t":[116],"gamma//sup":[121],"t/.":[122],"This":[123],"similar":[125],"objective":[128],"considered":[129],"in":[130],"Markov":[131],"decision":[132],"processes":[133],"(MDPs)":[134],"except":[135],"only":[137],"receive":[138],"visited.":[147],"We":[148],"also":[149],"consider":[150],"tree":[151],"multiple-path":[153],"variants":[154],"these":[156],"problems":[157,188],"provide":[159],"approximations":[160],"those":[162],"well.":[164],"Although":[165],"unrooted":[167],"there":[171],"no":[173],"fixed":[174,202],"s,":[177],"has":[178],"been":[179],"known":[180],"be":[182,199],"approximable":[183],"using":[184],"algorithms":[185],"related":[187],"such":[189],"k-TSP":[191],"(in":[192],"which":[193],"amount":[195],"collected":[200],"approximately":[208],"minimized),":[209],"ours":[210],"approximate":[215],"question,":[218],"solving":[219],"an":[220],"open":[221],"based":[223],"B.":[225],"Awerbuch":[226],"et":[227],"al.":[228],"(1999)":[229],"E.M.":[231],"Arkin":[232],"(1998).":[233]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}