On Salesmen, Repairmen, Spiders, and Other Traveling Agents
暂无分享,去创建一个
Giorgio Ausiello | Alberto Marchetti-Spaccamela | Stefano Leonardi | S. Leonardi | G. Ausiello | A. Marchetti-Spaccamela
[1] George Papageorgiou,et al. The Complexity of the Travelling Repairman Problem , 1986, RAIRO Theor. Informatics Appl..
[2] R. Ravi,et al. When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.
[3] Madhu Sudan,et al. The minimum latency problem , 1994, STOC '94.
[4] S. Trigila,et al. How to Move Mobile Agents , 2001 .
[5] Giorgio Gambosi,et al. Complexity and Approximation , 1999, Springer Berlin Heidelberg.
[6] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[7] Sanjeev Arora,et al. A 2 + ɛ approximation algorithm for the k-MST problem , 2000, SODA '00.
[8] Mihalis Yannakakis,et al. Searching a Fixed Graph , 1996, ICALP.
[9] Santosh S. Vempala,et al. A constant-factor approximation algorithm for the k MST problem (extended abstract) , 1996, STOC '96.
[10] Jon M. Kleinberg,et al. An improved approximation ratio for the minimum latency problem , 1996, SODA '96.
[11] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[12] Giorgio Gambosi,et al. The Complexity of Optimization Problems , 1999 .
[13] Sunil Arya,et al. A 2.5-Factor Approximation Algorithm for the k-MST Problem , 1998, Inf. Process. Lett..
[14] R. Ravi,et al. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..
[15] Naveen Garg,et al. A 3-approximation for the minimum tree spanning k vertices , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[16] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.
[17] Sanjeev Arora,et al. Approximation schemes for minimum latency problems , 1999, STOC '99.