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 209 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximation algorithms for fair k-median problem without fairness violation;Theoretical Computer Science;2024-02

2. Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor;Journal of the ACM;2024-01-02

3. Covering Planar Metrics (and Beyond): O(1) Trees Suffice;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. A randomized algorithm for online metric b-matching;Operations Research Letters;2023-11

5. The Ultrametric Gromov–Wasserstein Distance;Discrete & Computational Geometry;2023-10-07