暂无分享,去创建一个
Madhu Sudan | Prabhakar Raghavan | Avrim Blum | William R. Pulleyblank | Don Coppersmith | Prasad Chalasani | A. Blum | D. Coppersmith | M. Sudan | P. Chalasani | P. Raghavan | W. Pulleyblank | Avrim Blum
[1] Abilio Lucena,et al. Time-dependent traveling salesman problem-the deliveryman case , 1990, Networks.
[2] Mihalis Yannakakis,et al. The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..
[3] Lucio Bianco,et al. The traveling salesman problem with cumulative costs , 1993, Networks.
[4] Mihalis Yannakakis,et al. Shortest Paths Without a Map , 1989, ICALP.
[5] George Papageorgiou,et al. The Complexity of the Travelling Repairman Problem , 1986, RAIRO Theor. Informatics Appl..
[6] Carsten Lund,et al. Proof verification and the intractability of approximation problems , 1992, FOCS 1992.
[7] Mihalis Yannakakis,et al. Shortest Paths Without a Map , 1989, Theor. Comput. Sci..
[8] V. Rich. Personal communication , 1989, Nature.
[9] E. Minieka. The delivery man problem on a tree network , 1990 .
[10] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[11] David P. Williamson,et al. A note on the prize collecting traveling salesman problem , 1993, Math. Program..
[12] Dorit S. Hochbaum,et al. An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane , 1994, STOC '94.