A Faster Algorithm for Computing the Link Distance Between Two Point Sets on the Real Line
暂无分享,去创建一个
[1] Godfried T. Toussaint,et al. A Comparison of Rhythmic Similarity Measures , 2004, ISMIR.
[2] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[3] Godfried T. Toussaint,et al. An algorithm for computing the restriction scaffold assignment problem in computational biology , 2005, Inf. Process. Lett..
[4] Samir Khuller,et al. Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality , 1995, J. Algorithms.
[5] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[6] Judith Keijsper,et al. An Efficient Algorithm for Minimum-Weight Bibranching , 1998, J. Comb. Theory, Ser. B.
[7] Heikki Mannila,et al. Distance measures for point sets and their computation , 1997, Acta Informatica.
[8] Alexander Schrijver. Min-max Relations for Directed Graphs , 1982 .
[9] N. Tomizawa,et al. On some techniques useful for solution of transportation network problems , 1971, Networks.
[10] H. Kuhn. The Hungarian method for the assignment problem , 1955 .