{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T05:46:55Z","timestamp":1781329615799,"version":"3.54.1"},"reference-count":18,"publisher":"IEEE Computer. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2003.1238180","type":"proceedings-article","created":{"date-parts":[[2004,3,2]],"date-time":"2004-03-02T02:26:50Z","timestamp":1078194410000},"page":"46-55","source":"Crossref","is-referenced-by-count":46,"title":["Approximation algorithms for orienteering and discounted-reward TSP"],"prefix":"10.1109","author":[{"given":"A.","family":"Blum","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Chawla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D.R.","family":"Karger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T.","family":"Lane","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Meyerson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Minkoff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","author":"puterman","year":"1994","journal-title":"Markov Decision Processes"},{"key":"18","author":"sutton","year":"1998","journal-title":"Reinforcement Learning An Introduction"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1117\/12.457435"},{"key":"16","article-title":"Nearly deterministic abstractions of markov decision processes","author":"lane","year":"0","journal-title":"Proceedings of the Eighteenth National Conference on Artificial Intelligence Edmonton 2002"},{"key":"13","first-page":"760","article-title":"The prize collecting steiner tree problem: Theory and practice","author":"johnson","year":"2000","journal-title":"Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"14","doi-asserted-by":"crossref","DOI":"10.1613\/jair.301","article-title":"Reinforcement learning: A survey","volume":"4","author":"kaelbling","year":"1996","journal-title":"Journal of Artificial Intelligence Research"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979528826X"},{"key":"2","first-page":"754","article-title":"A 2 + ? approximation algorithm for the k-MST problem","author":"arora","year":"2000","journal-title":"Symposium on Discrete Algorithms"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/276884.276919"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"7","first-page":"101","article-title":"A constant-factor approximation algorithm for the k-MST problem","volume":"58","author":"blum","year":"1999","journal-title":"JCSS"},{"key":"6","author":"bertsekas","year":"1996","journal-title":"Neural Dynamic Programming"},{"key":"5","author":"bertsekas","year":"1995","journal-title":"Dynamic Programming and Optimal Control"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190602"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548489"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238179"}],"event":{"name":"44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003","location":"Cambridge, MA, USA","acronym":"SFCS-03"},"container-title":["44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8767\/27770\/01238180.pdf?arnumber=1238180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T08:55:51Z","timestamp":1585644951000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1238180\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2003.1238180","relation":{},"subject":[]}}