The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
The Rectilinear Steiner Tree Problem is $NP$-Complete
Abstract
An optimum rectilinear Steiner tree for a set A of points in the plane is a tree which interconnects A using horizontal and vertical lines of shortest possible total length. Such trees correspond to single net wiring patterns on printed backplanes which minimize total wire length. We show that the problem of determining this minimum length, given A, is $NP$-complete. Thus the problem of finding optimum rectilinear Steiner trees is probably computationally hopeless, and the emphasis of the literature for this problem on heuristics and special case algorithms is well justified. A number of intermediary lemmas concerning the $NP$-completeness of certain graph-theoretic problems are proved and may be of independent interest.
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
Cites
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Some simplified NP-complete graph problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90059-1 · Cited by 2,059
Self-citationHopcroft, J., & Tarjan, R. (1974) · Journal of the ACM · doi:10.1145/321850.321852 · Cited by 1,081
On the Computational Complexity of Combinatorial Problems
Karp, R. M. (1975) · Networks · doi:10.1002/net.1975.5.1.45 · Cited by 711
Dreyfus, S. E., & Wagner, R. A. (1971) · Networks · doi:10.1002/net.3230010302 · Cited by 696
Gilbert, E. N., & Pollak, H. O. (1968) · SIAM Journal on Applied Mathematics · doi:10.1137/0116001 · Cited by 690
On Steiner’s Problem with Rectilinear Distance
Hanan, M. (1966) · SIAM Journal on Applied Mathematics · doi:10.1137/0114025 · Cited by 623
On Steiner Minimal Trees with Rectilinear Distance
Hwang, F. K. (1976) · SIAM Journal on Applied Mathematics · doi:10.1137/0130013 · Cited by 424
Steiner's problem in graphs and its implications
Hakimi, S. L. (1971) · Networks · doi:10.1002/net.3230010203 · Cited by 347
Cited by
Clark, B. N., Colbourn, C. J., & Johnson, D. S. (1990) · Discrete Mathematics · doi:10.1016/0012-365x(90)90358-o · Cited by 1,429
Self-citationThe NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
Self-citationHwang, F. K., & Richards, D. S. (1992) · Networks · doi:10.1002/net.3230220105 · Cited by 663
Steiner problem in networks: A survey
Winter, P. (1987) · Networks · doi:10.1002/net.3230170203 · Cited by 599
GRANT, T., FROST, D. R., CALDWELL, J. P., GAGLIARDO, R., HADDAD, C. F. B., KOK, P. J. R., MEANS, D. B., NOONAN, B. P., SCHARGEL, W. E., & WHEELER, W. C. (2006) · Bulletin of the American Museum of Natural History · doi:10.1206/0003-0090(2006)299[1:psodfa]2.0.co;2 · Cited by 578
The Complexity of Computing Steiner Minimal Trees
Garey, M. R., Graham, R. L., & Johnson, D. S. (1977) · SIAM Journal on Applied Mathematics · doi:10.1137/0132072 · Cited by 576
Self-citationKagNet: Knowledge-Aware Graph Networks for Commonsense Reasoning
Lin, B. Y., Chen, X., Chen, J., & Ren, X. (2019) · Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) · doi:10.18653/v1/d19-1282 · Cited by 452
Quantum optimization of maximum independent set using Rydberg atom arrays
Ebadi, S., Keesling, A., Cain, M., Wang, T. T., Levine, H., Bluvstein, D., Semeghini, G., Omran, A., Liu, J.-G., Samajdar, R., et al. (2022) · Science · doi:10.1126/science.abo6587 · Cited by 430
Some NP-complete geometric problems
Garey, M. R., Graham, R. L., & Johnson, D. S. (1976) · Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 · doi:10.1145/800113.803626 · Cited by 400
Self-citationTighter Bounds for Graph Steiner Tree Approximation
Robins, G., & Zelikovsky, A. (2005) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480101393155 · Cited by 327
An improved LP-based approximation for steiner tree
Byrka, J., Grandoni, F., Rothvoß, T., & Sanità, L. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806769 · Cited by 296
Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization
Fukuda, T., Morimoto, Y., Morishita, S., & Tokuyama, T. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233313 · Cited by 265
Power outage prediction for natural hazards using synthetic power distribution systems
Zhai, C., Chen, T. Y.-J., White, A. G., & Guikema, S. D. (2021) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2020.107348 · Cited by 64
Metadata
- Authors
- Garey, M. R., & Johnson, D. S.
- Venue
- SIAM Journal on Applied Mathematics
- Published
- 1977-06
- Volume
- 32
- Issue
- 4
- Pages
- 826-834
- ISSN
- 0036-1399 (ISSN-L)
- 1095-712X
- OpenAlex
- W2020112047
- Cited by
- 1,124
- References
- 11
- FWCI
- 8.24
- 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
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.