Y. Bartal, A. Blum, C. Burch, and A. Tomkins. "A polylog(n)-competitive algorithm for metrical task systems", Proceedings of the 29th Annual Symposium on the Theory of Computing, pages 711--719, (1997). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Approximating a Finite Metric by a Small Number of.. - Charikar, Chekuri.. (1998) (14 citations) (Correct)
....A powerful technique that has been successfully used recently in this context is to embed the given metric space in a simpler metric space such that the distances are approximately preserved in the embedding. New and improved algorithms have resulted from this idea for several important problems [20, 10, 4, 6]. Based on the work of Karp [16] and Alon et al. 1] Bartal defined probabilistic approximation of metric spaces by a set of simpler metric spaces. Formally, let M be a finite metric space defined on a vertex set V . For two metric spaces M 1 and M 2 defined on the same vertex set V , M 1 ....
Y. Bartal, A. Blum, C. Burch, and A. Tomkins. "A polylog(n)-competitive algorithm for metrical task systems", Proceedings of the 29th Annual Symposium on the Theory of Computing, pages 711--719, (1997).
Approximating a Finite Metric by a Small Number of.. - Charikar, Chekuri.. (1998) (14 citations) (Correct)
....A powerful technique that has been successfully used recently in this context is to embed the given metric space in a simpler metric space such that the distances are approximately preserved in the embedding. New and improved algorithms have resulted from this idea for several important problems [20, 10, 4, 6]. Based on the work of Karp [16] and Alon et al. 1] Bartal defined probabilistic approximation of metric spaces by a set of simpler metric spaces. Formally, let M be a finite metric space defined on a vertex set V . For two metric spaces M 1 and M 2 defined on the same vertex set V , M 1 ....
Y. Bartal, A. Blum, C. Burch, and A. Tomkins. "A polylog(n)-competitive algorithm for metrical task systems", Proceedings of the 29th Annual Symposium on the Theory of Computing, pages 711--719, (1997).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC