The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Spanning trees and optimization problems
Abstract
SPANNING TREES Counting Spanning Trees MINIMUM SPANNING TREES Introduction Bor Degreesuvka's Algorithm Prim's Algorithm Kruskal's Algorithm Applications Summary Bibliographic Notes and Further Reading Exercises SHORTEST-PATHS TREES Introduction Dijkstra's Algorithm The Bellman-Ford Algorithm Applications Summary Bibliographic Notes and Further Reading Exercises MINIMUM ROUTING COST SPANNING TREES Introduction Approximating by a Shortest-Paths Tree Approximating by a General Star A Reduction to the Metric Case A Polynomial Time Approximation Scheme Applications Summary Bibliographic Notes and Further Reading Exercises OPTIMAL COMMUNICATION SPANNING TREES Introduction Product-Requirement Sum-Requirement Multiple Sources Applications Summary Bibliographic Notes and Further Reading Exercises BALANCING THE TREE COSTS Introduction Light Approximate Shortest-Paths Trees Light Approximate Routing Cost Spanning Trees Applications Summary Bibliographic Notes and Further Reading Exercises STEINER TREES AND SOME OTHER PROBLEMS Steiner Minimal Trees Trees and Diameters Maximum Leaf Spanning Trees Some Other Problems Bibliographic Notes and Further Reading Exercises REFERENCES INDEX
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Fibonacci heaps and their uses in improved network optimization algorithms
Fredman, M. L., & Tarjan, R. E. (1987) · Journal of the ACM · doi:10.1145/28869.28874 · Cited by 3,132
Shortest paths algorithms: Theory and experimental evaluation
Cherkassky, B. V., Goldberg, A. V., & Radzik, T. (1996) · Mathematical Programming · doi:10.1007/bf02592101 · Cited by 899
A note on the metric properties of trees
Buneman, P. (1974) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(74)90047-1 · Cited by 329
Metadata
- Venue
- Choice Reviews Online
- Publisher
- American Library Association
- Published
- 2004-11-01
- Volume
- 42
- Issue
- 03
- Pages
- 42-1619a-42-1619a
- ISSN
- 0009-4978 (ISSN-L)
- 1523-8253
- OpenAlex
- W647522939
- Cited by
- 231
- References
- 5
- Type
- book review
- 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: Spanning trees and optimization problems. https://app.cochat.ai/papers/10.5860/choice.42-1619a
- The paper
- Spanning trees and optimization problems. (2004). Choice Reviews Online. https://doi.org/10.5860/choice.42-1619a
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.