论文信息 - Approximation Algorithms for Quickest Spanning Tree Problems - 字舞流文

Approximation Algorithms for Quickest Spanning Tree Problems

Refael Hassin | Asaf Levin | Refael Hassin | Asaf Levin

[1] Nageswara S. V. Rao,et al. Probabilistic quickest path algorithm , 2004, Theor. Comput. Sci..

[2] Blas Pelegrín,et al. On the sum-max bicriterion path problem , 1998, Comput. Oper. Res..

[3] Ernesto de Queirós Vieira Martins,et al. An algorithm for the quickest path problem , 1997, Oper. Res. Lett..

[4] Y. L. Chen,et al. Finding the k Quickset Simple Paths in a Network , 1994, Inf. Process. Lett..

[5] D. T. Lee,et al. The All-Pairs Quickest Path Problem , 1993, Inf. Process. Lett..

[6] J. Ben Rosen,et al. Algorithms for the quickest path problem and the enumeration of quickest paths , 1991, Comput. Oper. Res..

[7] Gen-Huey Chen,et al. On the Quickest Path Problem , 1990, Inf. Process. Lett..

[8] Michael H. Moore. On the Fastest Route for Convoy-Type Traffic in Flowrate-Constrained Networks , 1976 .

[9] Refael Hassin,et al. On the Minimum Diameter Spanning Tree Problem , 1995, Inf. Process. Lett..

[10] Yen-Liang Chen,et al. An algorithm for finding the k quickest paths in a network , 1993, Comput. Oper. Res..