Author:
Benkoczi Robert,Bhattacharya Binay,Chrobak Marek,Larmore Lawrence L.,Rytter Wojciech
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. 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)
2. Arya, V., Garg, N., Khandekar, R., Meyerson, A., Mungala, K., Pandit, V.: Local seach heuristic for k-median and facility location problems. In: Proc. 16th Annual ACOM Symposium on Computing, pp. 21–29 (2001)
3. Auletta, V., Parente, D., Persiano, G.: Dynamic and static algorithms for optimal placement of resources in a tree. Theoretical Computer Science 165, 441–461 (1996)
4. Auletta, V., Parente, D., Persiano, G.: Placing resources on a growing line. Journal of Algorithms 26, 87–100 (1998)
5. Benkoczi, R.R., Bhattacharya, B.K.: Spine tree decomposition. Technical Report CMPT1999-09, School of Computing Science, Simon Fraser University, Canada (1999)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献