A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
In this paper, we present a new bicriteria approximation algorithm for the degree-bounded minimum spanning tree problem. In this problem, we are given an undirected graph, a nonnegative cost function on the edges, and a positive integer B * , and the goal is to find a minimum-cost spanning tree T with maximum degree at most B * . In an n-node graph, our algorithm finds a spanning tree with maximum degree O(B * +logn) and cost O(opt B * ), where opt B * is the minimum cost of any spanning tree whose maximum degree is at most B * . Our algorithm uses ideas from Lagrangean duality. We show how a set of optimum Lagrangean multipliers yields bounds on both the degree and the cost of the computed solution.
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
Edmonds, J. (1967) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.071b.032 · Cited by 731
Cited by
Research Commentary: Technology-Mediated Learning—A Call for Greater Depth and Breadth of Research
Alavi, M., & Leidner, D. E. (2001) · Information Systems Research · doi:10.1287/isre.12.1.1.9720 · Cited by 689
A Developmental Perspective on Alcohol and Youths 16 to 20 Years of Age
Brown, S. A., McGue, M., Maggs, J., Schulenberg, J., Hingson, R., Swartzwelder, S., Martin, C., Chung, T., Tapert, S. F., Sher, K., et al. (2008) · Pediatrics · doi:10.1542/peds.2007-2243d · Cited by 612
Wechsler, H., & Nelson, T. F. (2008) · Journal of Studies on Alcohol and Drugs · doi:10.15288/jsad.2008.69.481 · Cited by 480
What Explains Community Coalition Effectiveness?
Zakocs, R. C., & Edwards, E. M. (2006) · American Journal of Preventive Medicine · doi:10.1016/j.amepre.2005.12.004 · Cited by 403
A survey of application-layer multicast protocols
Hosseini, M., Ahmed, D. T., Shirmohammadi, S., & Georganas, N. D. (2007) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2007.4317616 · Cited by 283
Metadata
- Authors
- Könemann, J., & Ravi, R.
- Venue
- SIAM Journal on Computing
- Published
- 2002-01
- Volume
- 31
- Issue
- 6
- Pages
- 1783-1793
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2063807274
- Cited by
- 149
- References
- 1
- FWCI
- 9.86
- Type
- journal article
- 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: A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees. https://app.cochat.ai/papers/10.1137/s009753970036917x
- The paper
- Könemann, J., & Ravi, R. (2002). A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees. SIAM Journal on Computing. https://doi.org/10.1137/s009753970036917x
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.