Splitting a Configuration in a Simplex
暂无分享,去创建一个
[1] Eytan Ronn,et al. NP-Complete Stable Matching Problems , 1990, J. Algorithms.
[2] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.
[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[4] Kazumiti Numata. PROPERTY OF THE OPTIMUM RELAXED SOLUTION FOR PROBLEM TO SCHEDULE INDEPENDENT TASKS ON UNRELATED PROCESSORS , 1989 .
[5] David Avis,et al. On the partitionability of point sets in space (preliminary report) , 1985, SCG '85.
[6] David Avis,et al. Triangulating point sets in space , 1987, Discret. Comput. Geom..
[7] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[8] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..
[9] Nimrod Megiddo,et al. Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[10] 田村 明久. A property of the divorce digraph for a stable marriage , 1990 .