A tight bound on approximating arbitrary metrics by tree metrics-Reference-Cited by-同舟云学术

A tight bound on approximating arbitrary metrics by tree metrics

Published:2004-11 Issue:3 Volume:69 Page:485-497
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Fakcharoenphol Jittat,Rao Satish,Talwar Kunal

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference50 articles.

1. A graph–theoretic game and its application to the k-server problem;Alon;SIAM J. Comput,1995

2. A. Archer, J. Fakcharoenphol, C. Harrelson, R. Krauthgamer, K. Talwar, E. Tardos, Approximate classification via earthmover metrics, in: Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithm, 2004.

3. An O(logk) approximate min-cut max-flow theorem and approximation algorithm;Aumann;SIAM J. Comput,1998

4. B. Awerbuch, Y. Azar, Buy-at-bulk network design, in: 38th Annual Symposium on Foundations of Computer Science, Miami Beach, FL, 20–22 October 1997, pp. 542–547.

5. B. Awerbuch, D. Peleg, Concurrent online tracking of mobile users, in: SIGCOMM, 1991, pp. 221–233.

Cited by 220 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improved lower bound for differentially private facility location;Information Processing Letters;2025-01

2. Deterministic 3-Server on a Circle and the Limitation of Canonical Potentials;Theoretical Computer Science;2024-09

3. A face cover perspective to \(\ell_{1}\) embeddings of planar graphs;ACM Transactions on Algorithms;2024-08-05

4. Stochastic embeddings of graphs into trees;Banach Journal of Mathematical Analysis;2024-07-26

5. Breaking the VLB Barrier for Oblivious Reconfigurable Networks;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10