Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 172

The DOI matches its Crossref record.

Approximating a finite metric by a small number of tree metrics

Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S. · 2002 · Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)

Abstract

Y. Bartal (1996, 1998) gave a randomized polynomial time algorithm that given any n point metric G, constructs a tree T such that the expected stretch (distortion) of any edge is at most O (log n log log n). His result has found several applications and in particular has resulted in approximation algorithms for many graph optimization problems. However approximation algorithms based on his result are inherently randomized. In this paper we derandomize the use of Bartal's algorithm in the design of approximation algorithms. We give an efficient polynomial time algorithm that given a finite n point metric G, constructs O(n log n) trees and a probability distribution /spl mu/ on them such that the expected stretch of any edge of G in a tree chosen according to /spl mu/ is at most O(log n log log n). Our result establishes that finite metrics can be probabilistically approximated by a small number of tree metrics. We obtain the first deterministic approximation algorithms for buy-at-bulk network design and vehicle routing; in addition we subsume results from our earlier work on derandomization. Our main result is obtained by a novel view of probabilistic approximation of metric spaces as a deterministic optimization problem via linear programming.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/sfcs.1998.743488

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 172

Metadata

Authors
Charikar, M., Chekuri, C., Goel, A., Guha, S., & Plotkin, S.
Venue
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
Published
2002-11-27
Pages
379-388
ISSN
0272-5428 (ISSN-L)
OpenAlex
W1952648253
Cited by
172
References
0
FWCI
11.82
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Approximating a finite metric by a small number of tree metrics. https://app.cochat.ai/papers/10.1109/sfcs.1998.743488
The paper
Charikar, M., Chekuri, C., Goel, A., Guha, S., & Plotkin, S. (2002). Approximating a finite metric by a small number of tree metrics. Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). https://doi.org/10.1109/sfcs.1998.743488

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.