论文信息 - The k best spanning arborescences of a network - 字舞流文

The k best spanning arborescences of a network

An efficient algorithm is presented for finding, in order, K best spanning arborescences in a given network with n vertices and m edges. The time is O(Km log n), and space is O(K + m).

Francesco Maffioli | Luigi Fratta | Paolo M. Camerini | P. Camerini | F. Maffioli | L. Fratta

[1] Francesco Maffioli,et al. A note on finding optimum branchings , 1979, Networks.

[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[3] Richard M. Karp,et al. A simple derivation of Edmonds' algorithm for optimum branchings , 1971, Networks.

[4] Harold N. Gabow,et al. Two Algorithms for Generating Weighted Spanning Trees in Order , 1977, SIAM J. Comput..

[5] Jeffrey D. Ullman,et al. Set Merging Algorithms , 1973, SIAM J. Comput..

[6] Katta G. Murty,et al. Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..

[7] Robert E. Tarjan,et al. Finding optimum branchings , 1977, Networks.

[8] Robert E. Tarjan,et al. Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

[9] Harold N Gabow. Finding All Spanning Trees of Undirected and Directed Graphs ; CU-CS-103-77 , 1977 .

[10] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[11] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[12] E. Lawler. A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .