core.ac.uk
acm.org
sci-hub.se 参考文章(29)
Pankaj K. Agarwal, Micha Sharir, Algorithmic techniques for geometric optimization Computer Science Today. pp. 234- 253 ,(1995) , 10.1007/BFB0015247
Alex Glozman, Klara Kedem, Gregory Shpitalnik, On Some Geometric Selection and Optimization Problems via Sorted Matrices workshop on algorithms and data structures. pp. 26- 37 ,(1995) , 10.1007/3-540-60220-8_48
Alan Gibbons, Algorithmic graph theory Cambridge University Press. ,(1985)
Micha Sharir, Emo Welzl, A combinatorial bound for linear programming and related problems STACS 92. pp. 567- 579 ,(1992) , 10.1007/3-540-55210-3_213
O. Kariv, S. L. Hakimi, An Algorithmic Approach to Network Location Problems. II: The p-Medians Siam Journal on Applied Mathematics. ,vol. 37, pp. 539- 560 ,(1979) , 10.1137/0137041
Bernard Chazelle, Jiří Matoušek, On linear-time deterministic algorithms for optimization problems in fixed dimension symposium on discrete algorithms. pp. 281- 290 ,(1993) , 10.5555/313559.313770
M.T. Ko, Y.T. Ching, Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under l ∞ -distance Discrete Applied Mathematics. ,vol. 40, pp. 397- 410 ,(1992) , 10.1016/0166-218X(92)90009-Y
Greg N Frederickson, Donald B Johnson, Finding kth paths and p-centers by generating and searching good data structures Journal of Algorithms. ,vol. 4, pp. 61- 80 ,(1983) , 10.1016/0196-6774(83)90035-4
N. Amenta, Helly-type theorems and Generalized Linear Programming Discrete and Computational Geometry. ,vol. 12, pp. 241- 261 ,(1994) , 10.1007/BF02574379
Greg N. Frederickson, Donald B. Johnson, Generalized Selection and Ranking: Sorted Matrices SIAM Journal on Computing. ,vol. 13, pp. 14- 30 ,(1984) , 10.1137/0213002