Approximation Algorithms for Orienteering and Discounted-Reward TSP
In this paper, we give the first constant-factor approximation algorithm for the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward traveling salesman problem (TSP), motivated by robot navigation. In both problems, we are given a graph with lengths on edges and...
Gespeichert in:
| Veröffentlicht in: | SIAM journal on computing Jg. 37; H. 2; S. 653 - 670 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Philadelphia
Society for Industrial and Applied Mathematics
01.01.2007
|
| Schlagworte: | |
| ISSN: | 0097-5397, 1095-7111 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In this paper, we give the first constant-factor approximation algorithm for the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward traveling salesman problem (TSP), motivated by robot navigation. In both problems, we are given a graph with lengths on edges and rewards on nodes, and a start node $s$. In the Orienteering problem, the goal is to find a path starting at $s$ that maximizes the reward collected, subject to a hard limit on the total length of the path. In the Discounted-Reward TSP, instead of a length limit we are given a discount factor $\gamma$, and the goal is to maximize the total discounted reward collected, where the reward for a node reached at time $t$ is discounted by $\gamma^t$. This problem is motivated by an approximation to a planning problem in the Markov decision process (MDP) framework under the commonly employed infinite horizon discounted reward optimality criterion. The approximation arises from a need to deal with exponentially large state spaces that emerge when trying to model one-time events and nonrepeatable rewards (such as for package deliveries). We also consider tree and multiple-path variants of these problems and provide approximations for those as well. Although the unrooted Orienteering problem, where there is no fixed start node $s$, has been known to be approximable using algorithms for related problems such as $k$-TSP (in which the amount of reward to be collected is fixed and the total length is approximately minimized), ours is the first to approximate the rooted question, solving an open problem in [E. M. Arkin, J. S. B. Mitchell, and G. Narasimhan, Proceedings of the $14$th ACM Symposium on Computational Geometry, 1998, pp. 307-316] and [B. Awerbuch, Y. Azar, A. Blum, and S. Vempala, SIAM J. Comput., 28 (1998), pp. 254-262]. We complement our approximation result for Orienteering by showing that the problem is APX-hard. |
|---|---|
| AbstractList | In this paper, we give the first constant-factor approximation algorithm for the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward traveling salesman problem (TSP), motivated by robot navigation. In both problems, we are given a graph with lengths on edges and rewards on nodes, and a start node $s$. In the Orienteering problem, the goal is to find a path starting at $s$ that maximizes the reward collected, subject to a hard limit on the total length of the path. In the Discounted-Reward TSP, instead of a length limit we are given a discount factor $\gamma$, and the goal is to maximize the total discounted reward collected, where the reward for a node reached at time $t$ is discounted by $\gamma^t$. This problem is motivated by an approximation to a planning problem in the Markov decision process (MDP) framework under the commonly employed infinite horizon discounted reward optimality criterion. The approximation arises from a need to deal with exponentially large state spaces that emerge when trying to model one-time events and nonrepeatable rewards (such as for package deliveries). We also consider tree and multiple-path variants of these problems and provide approximations for those as well. Although the unrooted Orienteering problem, where there is no fixed start node $s$, has been known to be approximable using algorithms for related problems such as $k$-TSP (in which the amount of reward to be collected is fixed and the total length is approximately minimized), ours is the first to approximate the rooted question, solving an open problem in [E. M. Arkin, J. S. B. Mitchell, and G. Narasimhan, Proceedings of the $14$th ACM Symposium on Computational Geometry, 1998, pp. 307-316] and [B. Awerbuch, Y. Azar, A. Blum, and S. Vempala, SIAM J. Comput., 28 (1998), pp. 254-262]. We complement our approximation result for Orienteering by showing that the problem is APX-hard. |
| Author | Blum, Avrim Chawla, Shuchi Lane, Terran Meyerson, Adam Karger, David R. Minkoff, Maria |
| Author_xml | – sequence: 1 givenname: Avrim surname: Blum fullname: Blum, Avrim – sequence: 2 givenname: Shuchi surname: Chawla fullname: Chawla, Shuchi – sequence: 3 givenname: David R. surname: Karger fullname: Karger, David R. – sequence: 4 givenname: Terran surname: Lane fullname: Lane, Terran – sequence: 5 givenname: Adam surname: Meyerson fullname: Meyerson, Adam – sequence: 6 givenname: Maria surname: Minkoff fullname: Minkoff, Maria |
| BookMark | eNptkMtKAzEUhoNUsK0ufIPBnYuxOZPLTJalWhUKFa3rITNJaso0qUmK-vaOVlyIqwOH7z-Xb4QGzjuN0DngKwBSTjDDnDLK6REaAhYsLwFggIYYizJnRJQnaBTjBmOgFMgQzaa7XfDvdiuT9S6bdmsfbHrZxsz4kC2D1S5pHaxbZ9Kp7NrG1u_7lsof9ZsMKls9PZyiYyO7qM9-6hg9z29Ws7t8sby9n00XeVswnnLWas50hRtBGDGkKQXnhdKGKqIwYAmaU1E0hnMsq0JJJlVFWQMtM4RDpckYXRzm9he_7nVM9cbvg-tX1gIqXjEgoocuD1AbfIxBm3oX-u_CRw24_lJU_yrq2ckftrXpW0QK0nb_JD4BaVFoqg |
| CitedBy_id | crossref_primary_10_1109_TWC_2020_2988271 crossref_primary_10_1109_TVT_2016_2592541 crossref_primary_10_1016_j_tcs_2024_114900 crossref_primary_10_3390_math11173646 crossref_primary_10_1002_net_20435 crossref_primary_10_1007_s10732_010_9153_z crossref_primary_10_1016_j_cor_2022_105882 crossref_primary_10_1109_ACCESS_2020_2974553 crossref_primary_10_1145_2953887 crossref_primary_10_1002_2013JC009521 crossref_primary_10_1016_j_ejor_2024_11_015 crossref_primary_10_1007_s10732_014_9242_5 crossref_primary_10_1007_s12597_020_00463_8 crossref_primary_10_1109_TNET_2015_2504603 crossref_primary_10_1145_2229163_2229167 crossref_primary_10_1016_j_eswa_2019_03_004 crossref_primary_10_1080_10556788_2024_2349091 crossref_primary_10_1007_s00453_016_0264_2 crossref_primary_10_1109_TRO_2016_2603528 crossref_primary_10_1007_s10618_016_0477_7 crossref_primary_10_1016_j_jcss_2021_12_001 crossref_primary_10_1109_TRO_2021_3082021 crossref_primary_10_1287_moor_2014_0656 crossref_primary_10_1145_3653713 crossref_primary_10_1016_j_procs_2018_10_375 crossref_primary_10_1137_18M1227135 crossref_primary_10_1007_s00453_012_9711_x crossref_primary_10_1145_3397180 crossref_primary_10_1145_3385008 crossref_primary_10_1007_s00453_011_9509_2 crossref_primary_10_1088_1741_2560_8_6_065010 crossref_primary_10_1109_ACCESS_2022_3141216 crossref_primary_10_1109_TNET_2020_3027434 crossref_primary_10_1137_080729918 crossref_primary_10_1016_j_comnet_2017_12_010 crossref_primary_10_1007_s10107_025_02221_4 crossref_primary_10_1016_j_tcs_2022_02_013 crossref_primary_10_1007_s00224_024_10213_8 crossref_primary_10_1016_j_trb_2016_02_002 crossref_primary_10_1109_TWC_2022_3197087 crossref_primary_10_1007_s00453_010_9462_5 crossref_primary_10_1016_j_cor_2024_106678 crossref_primary_10_1145_2908737 crossref_primary_10_1016_j_knosys_2025_113797 crossref_primary_10_1109_TASE_2020_2980854 crossref_primary_10_1137_20M135594X crossref_primary_10_1109_TRO_2018_2883829 crossref_primary_10_1109_LRA_2017_2717080 crossref_primary_10_1007_s00453_011_9515_4 crossref_primary_10_1016_j_tcs_2014_02_046 crossref_primary_10_1007_s10107_015_0927_9 crossref_primary_10_1016_j_orl_2017_10_013 crossref_primary_10_1007_s10479_025_06641_5 crossref_primary_10_1007_s10514_019_09871_2 crossref_primary_10_1016_j_disopt_2016_12_001 crossref_primary_10_1016_j_ipl_2014_10_003 crossref_primary_10_1371_journal_pone_0271751 crossref_primary_10_1007_s00453_011_9610_6 crossref_primary_10_1002_rob_21856 crossref_primary_10_1287_moor_2015_0729 crossref_primary_10_1016_j_tcs_2020_05_050 crossref_primary_10_1016_j_tcs_2022_11_009 crossref_primary_10_1016_j_phycom_2021_101435 crossref_primary_10_1109_TRO_2025_3548865 crossref_primary_10_1007_s10107_022_01841_4 crossref_primary_10_1145_3080575 crossref_primary_10_1016_j_endm_2013_05_133 crossref_primary_10_1109_TNET_2022_3167781 crossref_primary_10_1177_0278364913488427 crossref_primary_10_1016_j_cie_2013_01_010 crossref_primary_10_1137_090749347 |
| Cites_doi | 10.1006/jcss.1997.1542 10.1137/S009753979528826X 10.1613/jair.301 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D 10.1137/S0097539793242618 10.1002/net.3230190602 10.1007/BF01581256 |
| ContentType | Journal Article |
| Copyright | [Copyright] © 2007 Society for Industrial and Applied Mathematics |
| Copyright_xml | – notice: [Copyright] © 2007 Society for Industrial and Applied Mathematics |
| DBID | AAYXX CITATION 3V. 7RQ 7WY 7WZ 7X2 7XB 87Z 88A 88F 88I 88K 8AL 8FE 8FG 8FH 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS ATCPS AZQEC BBNVY BENPR BEZIV BGLVJ BHPHI CCPQU D1I DWQXO FRNLG F~G GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- KB. L.- L6V LK8 M0C M0K M0N M1Q M2O M2P M2T M7P M7S MBDVC P5Z P62 PATMY PDBOC PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS PYCSY Q9U S0W U9A |
| DOI | 10.1137/050645464 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Career & Technical Education Database (ProQuest) ABI/INFORM Collection ABI/INFORM Global (PDF only) Agricultural Science Collection ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Biology Database (Alumni Edition) Military Database (Alumni Edition) Science Database (Alumni Edition) Telecommunications (Alumni Edition) Computing Database (Alumni Edition) ProQuest SciTech Collection ProQuest Technology Collection ProQuest Natural Science Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Research Library (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection Agricultural & Environmental Science Collection ProQuest Central Essentials - QC Biological Science Collection ProQuest Central Business Premium Collection (Proquest) Technology Collection Natural Science Collection ProQuest One ProQuest Materials Science Collection ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student ProQuest Research Library SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database Materials Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection Biological Sciences ABI/INFORM Global Agricultural Science Database Computing Database Military Database Proquest Research Library Science Database Telecommunications Database Biological Science Database Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database (ProQuest) ProQuest Advanced Technologies & Aerospace Collection Environmental Science Database Materials Science Collection (ProQuest) ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection Environmental Science Collection (ProQuest) ProQuest Central Basic DELNET Engineering & Technology Collection |
| DatabaseTitle | CrossRef Agricultural Science Database ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Military Collection ProQuest Central China ABI/INFORM Complete ProQuest Telecommunications ProQuest One Applied & Life Sciences Natural Science Collection Biological Science Collection ProQuest Central (New) Engineering Collection Career and Technical Education (Alumni Edition) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest Biological Science Collection ProQuest One Academic Eastern Edition Agricultural Science Collection ProQuest Technology Collection ProQuest Telecommunications (Alumni Edition) Biological Science Database ProQuest Business Collection Environmental Science Collection ProQuest Career and Technical Education ProQuest One Academic UKI Edition Environmental Science Database ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection ProQuest One Academic Middle East (New) Materials Science Collection ProQuest Central (Alumni Edition) ProQuest One Community College Research Library (Alumni Edition) ProQuest Natural Science Collection ProQuest Biology Journals (Alumni Edition) ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea Agricultural & Environmental Science Collection Materials Science Database ProQuest Research Library ABI/INFORM Complete (Alumni Edition) ProQuest Materials Science Collection ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest Military Collection (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest DELNET Engineering and Technology Collection Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | Agricultural Science Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1095-7111 |
| EndPage | 670 |
| ExternalDocumentID | 2573887801 10_1137_050645464 |
| GroupedDBID | --Z -DZ -~X .4S .DC 123 4.4 7RQ 7WY 7X2 7XC 88I 8CJ 8FE 8FG 8FH 8FL 8G5 8V8 AALVN AASXH AAYXX ABDBF ABDPE ABJCF ABKAD ABMZU ABPPZ ABUFD ABUWG ACBEA ACGFO ACGOD ACIWK ACNCT ACPRK ACUHS ADBBV ADMHC ADXHL AEMOZ AENEX AFFHD AFKRA AFRAH AHQJS AKVCP ALMA_UNASSIGNED_HOLDINGS ANXRF ARAPS ARCSS ATCPS AZQEC BBNVY BENPR BEZIV BGLVJ BHPHI BPHCQ CCPQU CITATION CS3 CZ9 D1I D1J D1K DQ2 DU5 DWQXO EAP EAS EBR EBS EBU ECS EDO EJD EMK EST ESX FRNLG GNUQQ GUQSH H13 HCIFZ H~9 I-F K1G K6- K60 K6V K6~ K7- KB. KC. L6V LK5 LK8 M0C M0K M1Q M2O M2P M7P M7R M7S MK~ NHB OHT P1Q P2P P62 PATMY PDBOC PHGZM PHGZT PQBIZ PQBZA PQGLB PQQKQ PROAC PTHSS PYCSY RJG RNS RSI S0W TAE TH9 TN5 TUS TWZ UHB UQL VOH WH7 WHG XJE YNT YYP YZZ ZCG ZY4 3V. 7XB 88A 88K 8AL 8FK JQ2 L.- M0N M2T MBDVC PKEHL PQEST PQUKI PRINS Q9U U9A |
| ID | FETCH-LOGICAL-c256t-5ce65e80b9353f3b79662def4d3d010a1e6492bf660a82da5ad845b1c5f3618e3 |
| IEDL.DBID | M7P |
| ISICitedReferencesCount | 142 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000247647200014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0097-5397 |
| IngestDate | Tue Nov 18 05:43:31 EST 2025 Sat Nov 29 03:54:34 EST 2025 Tue Nov 18 21:33:55 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c256t-5ce65e80b9353f3b79662def4d3d010a1e6492bf660a82da5ad845b1c5f3618e3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 content type line 14 |
| PQID | 918685139 |
| PQPubID | 666313 |
| PageCount | 18 |
| ParticipantIDs | proquest_journals_918685139 crossref_primary_10_1137_050645464 crossref_citationtrail_10_1137_050645464 |
| PublicationCentury | 2000 |
| PublicationDate | 2007-01-00 20070101 |
| PublicationDateYYYYMMDD | 2007-01-01 |
| PublicationDate_xml | – month: 01 year: 2007 text: 2007-01-00 |
| PublicationDecade | 2000 |
| PublicationPlace | Philadelphia |
| PublicationPlace_xml | – name: Philadelphia |
| PublicationTitle | SIAM journal on computing |
| PublicationYear | 2007 |
| Publisher | Society for Industrial and Applied Mathematics |
| Publisher_xml | – name: Society for Industrial and Applied Mathematics |
| References | R3 R4 R8 R9 R18 Kaelbling L. P. (R21) 1996; 4 R19 |
| References_xml | – ident: R9 doi: 10.1006/jcss.1997.1542 – ident: R3 doi: 10.1137/S009753979528826X – volume: 4 start-page: 237 issn: 1076-9757 year: 1996 ident: R21 publication-title: J. Artificial Intelligence Res. doi: 10.1613/jair.301 – ident: R19 doi: 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D – ident: R18 doi: 10.1137/S0097539793242618 – ident: R4 doi: 10.1002/net.3230190602 – ident: R8 doi: 10.1007/BF01581256 |
| SSID | ssj0014413 |
| Score | 2.2454689 |
| Snippet | In this paper, we give the first constant-factor approximation algorithm for the rooted Orienteering problem, as well as a new problem that we call the... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 653 |
| SubjectTerms | Algorithms Approximation Computer science Expected values Graduate students Markov analysis Orienteering Probability distribution Random variables Robots Traveling salesman problem |
| Title | Approximation Algorithms for Orienteering and Discounted-Reward TSP |
| URI | https://www.proquest.com/docview/918685139 |
| Volume | 37 |
| WOSCitedRecordID | wos000247647200014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: 7WY dateStart: 19720301 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M0C dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: P5Z dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Agricultural Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M0K dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/agriculturejournals providerName: ProQuest – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M7P dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Career & Technical Education Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: 7RQ dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/career providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: K7- dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database (subscription) customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M7S dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Environmental Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: PATMY dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/environmentalscience providerName: ProQuest – providerCode: PRVPQU databaseName: Materials Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: KB. dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/materialsscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Military Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M1Q dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/military providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: BENPR dateStart: 19720301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Research Library customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M2O dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M2P dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwEB4V6KEceLVVeXRlVRy4mCaxnccJLQuoEtolLFtBe4kSj92uBMsjAfHzsR1vJKSKSy-fFHkURRnbM7bH3wewyzmiRM4oYhBQXnGkVZQijXXFeZlqNM1ObCIZjdKrqyz3tTm1L6ucz4luosZbaffIv2eW112YfOXg7p5a0Sh7uOoVNBZgyZIkMFe5l3eHCCbSexLKhAoTdz2xUGgpfRxPG4_563D0ejZ2IeZk9T8_bg1WfG5J-m1nWId3arYBq3PdBuKH8QYsDzuu1vojDPqWVvx52t5hJP3rP-bVzd-bmph8lpxZHuSmJSwk5QzJ0bR2-hIK6VjZklsyucg_wc-T48ngB_XSClSaHKehQqpYqDSoMiaYZlViVj0RKs2RoVmhlaGKeRZVOo6DMo2wFCWmXFShFJrFYarYZ1ic3c7UFyAplsYmRBP2kDv1Yi6zOKlQY6CllpuwN__DhfS841b-4rpw6w-WFJ0zNuFbZ3rXkm38y2h77oPCj7e66Byw9WbrNnxo92btFsoOLDYPj-orvJdPzbR-6MFCMj63ePmrB0uHx6N8bJ5OE2rxcN_gMBg4PLUYWtthdOYwdzjpuR7o8MJgLn6_AFvH2ro |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3JSgQxEC3cQD24i-MaRMFLsJf0dhAZXFBmcRvBW9udSnRgnFG73T7KfzTpDQTx5sFzioZ0VapeZXkPYIsxRI7MpoiGQVnMkMaWj9SVMWORL1ENZ2ITXrvt39wE50PwWb6F0dcqy5yYJWoccL1HvhtoXndH4ZX9xyeqRaP04WqpoJFHRUN8vKmOLdk7PVTu3bas46POwQktRAUoV9U9pQ4XriN8Iw5sx5Z27Cm8b6GQDG1UvUlkCpcFVixd14h8CyMnQp85sckdabumL2z13WEYZQro6AXVMi-qQwuFLArSS486qs4XREamphDKeOGYy76Xv-_ZPytpx9P_7GfMwFSBnUk9D_ZZGBL9OZgudSlIkabmYLJVcdEm83BQ17Tp7938jSap9-7UVNL7h4QovE7ONM9zmhMykqiP5LCbZPoZAuml0FeKSefqfAGu_2RiizDSH_TFEhAfI2VjoirryDJ1ZsYD14tRoiG55DXYKT0a8oJXXct79MKsv7K9sHJ-DTYr08ecTOQno5XS52GRT5Kwcvjyr6MbMH7SaTXD5mm7sQIT-T603i5ahZH0-UWswRh_TbvJ83oWuQRu_zo6vgCUGiqX |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Approximation+Algorithms+for+Orienteering+and+Discounted-Reward+TSP&rft.jtitle=SIAM+journal+on+computing&rft.au=Blum%2C+Avrim&rft.au=Chawla%2C+Shuchi&rft.au=Karger%2C+David+R.&rft.au=Lane%2C+Terran&rft.date=2007-01-01&rft.issn=0097-5397&rft.eissn=1095-7111&rft.volume=37&rft.issue=2&rft.spage=653&rft.epage=670&rft_id=info:doi/10.1137%2F050645464&rft.externalDBID=n%2Fa&rft.externalDocID=10_1137_050645464 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0097-5397&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0097-5397&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0097-5397&client=summon |