Author:
Benkoczi Robert,Bhattacharya Binay
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Lecture Notes in Computer Science;S. Alstrup,2000
2. Arora, S., Raghavan, P., Rao, S.: Approximation schemes for euclidean k-medians and related problems. In: Proc. 30th Annual ACM Symposium on Theory of Computing (STOC 1998), pp. 106–113 (1998)
3. Arya, V., Garg, N., Khandekar, R., Meyerson, A., Mungala, K., Pandit, V.: Local seach heuristic for k-median and facility location problems. In: Proc. 33rd Annual ACM Symposium on Theory of Computing, pp. 21–29 (2001)
4. Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Proc. STOC, pp. 183–193 (1998)
5. Benkoczi, R.: Cardinality constrained facility location problems in trees. PhD thesis, School of Computing Science, Simon Fraser University, Burnaby, BC, Canada (May 2004)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献