Author:
Chung Christine,Pruhs Kirk,Uthaisombut Patchrawat
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: ACM Symposium on Theory of Computing, pp. 161–168 (1998)
2. Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.: Approximating a finite metric by a small number of tree metrics. In: Symposium on Foundations of Computer Science, p. 379 (1998)
3. Csaba, B., Pluhar, A.: A randomized algorithm for the on-line weighted bipartite matching problem. Journal of Scheduling (to appear)
4. Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. Journal of Computer and System Sciences Special Issue on STOC 2003 69(3), 485–497 (2004)
5. Gupta, A., Hajiaghayi, M.T., Räcke, H.: Oblivious network design. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 970–979 (2006)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献