Author:
Ben-Moshe Boaz,Bhattacharya Binay,Shi Qiaosheng
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34, 200–208 (1987)
2. Frederickson, G.N.: Parametric search and locating supply centers in trees. In: WADS, pp. 299–319 (1991)
3. Halman, N.: Discrete and lexicographic helly theorems and their relations to LPtype problems., Ph.D. Thesis, Tel Aviv Univ. (2004)
4. Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, Part I. The p-centers. SIAM J. Appl. Math. 37, 513–538 (1979)
5. Megiddo, N.: Linear-time algorithms for linear programming in R3 and related problems. SIAM J. Comput. 12(4), 759–776 (1983)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献