The DOI matches its Crossref record.
A new class of iterative Steiner tree heuristics with good performance
Abstract
A fast approach to the minimum rectilinear Steiner tree (MRST) problem is presented. The method yields results that reduce wire length by up to 2% to 3% over the previous methods, and is the first heuristic which has been shown to have a performance ratio less than 3/2; in fact, the performance ratio is less than or equal to 4/3 on the entire class of instances where the ratio c(MST)/c(MRST) is exactly equal to 3/2. The algorithm has practical asymptotic complexity owing to an elegant implementation which uses methods from computation geometry and which parallelizes readily. A randomized variation of the algorithm, along with a batched variant, has also proved successful.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Performance optimization of VLSI interconnect layout
Cong, J., He, L., Koh, C.-K., & Madden, P. H. (1996) · Integration · doi:10.1016/s0167-9260(96)00008-9 · Cited by 334
Tighter Bounds for Graph Steiner Tree Approximation
Robins, G., & Zelikovsky, A. (2005) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480101393155 · Cited by 327
Self-citation
Metadata
- Authors
- Kahng, A. B., & Robins, G.
- Venue
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Published
- 1992-07
- Volume
- 11
- Issue
- 7
- Pages
- 893-902
- ISSN
- 0278-0070 (ISSN-L)
- OpenAlex
- W2140055763
- Cited by
- 215
- References
- 0
- FWCI
- 14.92
- Type
- journal article
- 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: A new class of iterative Steiner tree heuristics with good performance. https://app.cochat.ai/papers/10.1109/43.144853
- The paper
- Kahng, A. B., & Robins, G. (1992). A new class of iterative Steiner tree heuristics with good performance. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. https://doi.org/10.1109/43.144853
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.