Linear-time algorithms for linear programming in R3 and related problems
暂无分享,去创建一个
[1] J. Sylvester. XXVII. On Poncelet's approximate linear Valuation of surd forms , 1860 .
[2] X. Ren,et al. Mathematics , 1935, Nature.
[3] C. O. Oakley,et al. The Enjoyment of Mathematics. , 1957 .
[4] Richard D. Smallwood,et al. Minimax Detection Station Placement , 1965 .
[5] K. Nair,et al. Optimal location of a single service center of certain types , 1971 .
[6] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..
[7] D. Hearn,et al. Geometrical Solutions for Some Minimax Location Problems , 1972 .
[8] R. L. Francis,et al. A Minimax Location Problem on a Network , 1974 .
[9] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[10] Michael Ian Shamos,et al. Geometric complexity , 1975, STOC.
[11] F. P. Preparata,et al. Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.
[12] S. Hakimi,et al. On p -Centers in Networks , 1978 .
[13] Pitu B. Mirchandani,et al. Location on networks : theory and algorithms , 1979 .
[14] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .
[15] Zvi Drezner,et al. Single Facility lp-Distance Minimax Location , 1980, SIAM J. Algebraic Discret. Methods.
[16] David P. Dobkin,et al. The Complexity of Linear Programming , 1980, Theor. Comput. Sci..
[17] Nimrod Megiddo,et al. Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[18] Andrew Chi-Chih Yao,et al. A Lower Bound to Finding Convex Hulls , 1981, JACM.