论文信息 - Recurrence relations based on minimization and maximization - 字舞流文

Recurrence relations based on minimization and maximization

E. Reingold | S. Kapoor

[1] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[2] D. Knuth,et al. Recurrence relations based on minimization , 1974 .

[3] D. Knuth,et al. Mathematics for the Analysis of Algorithms , 1999 .

[4] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[5] Robert E. Tarjan,et al. On a Greedy Heuristic for Complete Matching , 1981, SIAM J. Comput..

[6] Edward M. Reingold,et al. Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching , 1983, SIAM J. Comput..