Faster approximation algorithms for the minimum latency problem
暂无分享,去创建一个
[1] John N. Tsitsiklis,et al. Special cases of traveling salesman and repairman problems with time windows , 1992, Networks.
[2] David Simchi-Levi,et al. Minimizing the Total Flow Time of n Jobs on a Network , 1991 .
[3] Sunil Arya,et al. A 2.5-Factor Approximation Algorithm for the k-MST Problem , 1998, Inf. Process. Lett..
[4] Andrzej Lingas,et al. Approximation algorithms for time-dependent orienteering , 2001, Inf. Process. Lett..
[5] Sanjeev Arora,et al. A 2 + ɛ approximation algorithm for the k-MST problem , 2000, SODA '00.
[6] Oded Berman,et al. Sales-delivery man problems on treelike networks , 1995, Networks.
[7] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[8] René Sitters,et al. The Minimum Latency Problem Is NP-Hard for Weighted Trees , 2002, IPCO.
[9] Seth Pettie,et al. The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms , 2002, SWAT.
[10] Leen Stougie,et al. News from the online traveling repairman , 2003, Theor. Comput. Sci..
[11] Matteo Fischetti,et al. The Delivery Man Problem and Cumulative Matroids , 1993, Oper. Res..
[12] Ian R. Webb,et al. Depth-First Solutions for the Deliveryman Problem on Tree-Like Networks: An Evaluation Using a Permutation Model , 1996, Transp. Sci..
[13] E. Minieka. The delivery man problem on a tree network , 1990 .
[14] Nikolaos V. Sahinidis,et al. Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem , 1995, Transp. Sci..
[15] Leen Stougie,et al. On-line single-server dial-a-ride problems , 2001, Theor. Comput. Sci..
[16] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.
[17] Mihalis Yannakakis,et al. The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..
[18] Lucio Bianco,et al. The traveling salesman problem with cumulative costs , 1993, Networks.
[19] Jon M. Kleinberg,et al. An improved approximation ratio for the minimum latency problem , 1996, SODA '96.
[20] Tim Roughgarden,et al. Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation , 2001, Math. Program..
[21] Saligrama R. Agnihothri. A Mean Value Analysis of the Travelling Repairman Problem , 1988 .
[22] Bang Ye Wu,et al. Polynomial time algorithms for some minimum latency problems , 2000, Inf. Process. Lett..
[23] Madhu Sudan,et al. The minimum latency problem , 1994, STOC '94.
[24] Abilio Lucena,et al. Time-dependent traveling salesman problem-the deliveryman case , 1990, Networks.
[25] Maurice Queyranne,et al. The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..
[26] Russ J. Vander Wiel,et al. An exact solution approach for the time‐dependent traveling‐salesman problem , 1996 .
[27] Satish Rao,et al. The k-traveling repairman problem , 2003, SODA '03.
[28] Mihalis Yannakakis,et al. Searching a Fixed Graph , 1996, ICALP.
[29] Sanjeev Arora,et al. Approximation schemes for minimum latency problems , 1999, STOC '99.
[30] Giorgio Ausiello,et al. On Salesmen, Repairmen, Spiders, and Other Traveling Agents , 2000, CIAC.
[31] Naveen Garg,et al. A 3-approximation for the minimum tree spanning k vertices , 1996, Proceedings of 37th Conference on Foundations of Computer Science.