The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
What cannot be computed locally!
Open accessAbstract
We give time lower bounds for the distributed approximation of minimum vertex cover (MVC) and related problems such as minimum dominating set (MDS). In k communication rounds, MVC and MDS can only be approximated by factors Ω(nc/k2/k) and Ω(∆1/k /k) for some constant c, where n and ∆ denote the number of nodes and the largest degree in the graph. The number of rounds required in order to achieve a constant or even only a polylogarithmic approximation ratio is at least Ω ( √ log n / log log n) and Ω(log ∆ / log log ∆). By a simple reduction, the latter lower bounds also hold for the construction of maximal matchings and maximal independent sets.
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.
Integrity signals
Registry
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.
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
Cites
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
A threshold of ln n for approximating set cover
Feige, U. (1998) · Journal of the ACM · doi:10.1145/285055.285059 · Cited by 3,086
Distributed Computing: A Locality-Sensitive Approach
Peleg, D. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719772 · Cited by 1,487
A Simple Parallel Algorithm for the Maximal Independent Set Problem
Luby, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215074 · Cited by 1,147
Locality in Distributed Graph Algorithms
Linial, N. (1992) · SIAM Journal on Computing · doi:10.1137/0221015 · Cited by 870
Deterministic coin tossing with applications to optimal parallel list ranking
Cole, R. J., & Vishkin, U. (1986) · Information and Control · doi:10.1016/s0019-9958(86)80023-7 · Cited by 413
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
Kushilevitz, E., & Mansour, Y. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539794279109 · Cited by 273
Hundreds of impossibility results for distributed computing
Fich, F. E., & Ruppert, E. (2003) · Distributed Computing · doi:10.1007/s00446-003-0091-y · Cited by 155
Metadata
- Authors
- Kuhn, F., Moscibroda, T., & Wattenhofer, R.
- Venue
- Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
- Publisher
- ACM
- Published
- 2004-07-25
- Pages
- 300-309
- OpenAlex
- W2165441947
- Cited by
- 274
- References
- 9
- FWCI
- 11.38
- Type
- conference paper
- Language
- en
- Open access
- green
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: What cannot be computed locally! https://app.cochat.ai/papers/10.1145/1011767.1011811
- The paper
- Kuhn, F., Moscibroda, T., & Wattenhofer, R. (2004). What cannot be computed locally! Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing. https://doi.org/10.1145/1011767.1011811
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.