Approximation algorithms for orienteering and discounted-reward TSP
暂无分享,去创建一个
David R. Karger | Adam Meyerson | Avrim Blum | Shuchi Chawla | Terran Lane | Maria Minkoff | A. Blum | Shuchi Chawla | A. Meyerson | T. Lane | M. Minkoff | David R Karger | Avrim Blum
[1] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[2] Santosh S. Vempala,et al. New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen , 1999, SIAM J. Comput..
[3] John N. Tsitsiklis,et al. Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.
[4] A. Blum,et al. Graph algorithms for planning and partitioning , 2005 .
[5] Dimitri P. Bertsekas,et al. Dynamic Programming and Optimal Control, Two Volume Set , 1995 .
[6] Adam Meyerson,et al. Approximation algorithms for deadline-TSP and vehicle routing with time-windows , 2004, STOC '04.
[7] David S. Johnson,et al. The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.
[8] Egon Balas,et al. The prize collecting traveling salesman problem , 1989, Networks.
[9] Chandra Chekuri,et al. A recursive greedy algorithm for walks in directed graphs , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[10] Sanjeev Arora,et al. A 2 + ɛ approximation algorithm for the k-MST problem , 2000, SODA '00.
[11] Marek Karpinski,et al. Approximation Hardness of TSP with Bounded Metrics , 2001, ICALP.
[12] Giri Narasimhan,et al. Resource-constrained geometric network optimization , 1998, SCG '98.
[13] Robert Krauthgamer,et al. Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[14] Andrew W. Moore,et al. Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..
[15] David P. Williamson,et al. A note on the prize collecting traveling salesman problem , 1993, Math. Program..
[16] Leslie Pack Kaelbling,et al. Approaches to macro decompositions of large Markov decision process planning problems , 2002, SPIE Optics East.
[17] Santosh S. Vempala,et al. Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen , 1995, STOC '95.
[18] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.
[19] R. Vohra,et al. The Orienteering Problem , 1987 .
[20] Santosh S. Vempala,et al. A Constant-Factor Approximation Algorithm for the k-MST Problem , 1999, J. Comput. Syst. Sci..
[21] Satish Rao,et al. Paths, trees, and minimum latency tours , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[22] V. Rich. Personal communication , 1989, Nature.
[23] Amit Kumar,et al. Maximum Coverage Problem with Group Budget Constraints and Applications , 2004, APPROX-RANDOM.
[24] Naveen Garg,et al. A 3-approximation for the minimum tree spanning k vertices , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[25] Sanjeev Arora,et al. A 2+epsilon approximation algorithm for the k-MST problem , 2000, SODA.
[26] Naveen Garg,et al. Saving an epsilon: a 2-approximation for the k-MST problem in graphs , 2005, STOC '05.
[27] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[28] Leslie Pack Kaelbling,et al. Nearly deterministic abstractions of Markov decision processes , 2002, AAAI/IAAI.