CoChat
Sign Up
Cited by 3

The DOI matches its Crossref record.

A Genetic Algorithm for Solving the Euclidean Non-Uniform Steiner Tree Problem

Frommer, Ian, Golden, Bruce·2007·Operations Research/Computer Science Interfaces Series
DOI 10.1007/978-0-387-48793-9_3
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1007/978-0-387-48793-9_3

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 33

  1. P. Winter. The Steiner problem in networks: A survey. Networks, 17(2): 129–167, 1987. · DOI
  2. J. M. Smith and J. S. Liebman. Steiner trees, Steiner circuits, and the interference problem in building design. Engineering Design, 4:15–36, 1979.
  3. C. Alpert, G. Gandham, J. Hu, J. Neves, S. Quay, and S. Sapatnekar. Steiner tree optimization for buffers, blockages and bays. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 20(4):556–562, 2001. · DOI
  4. F. K. Hwang, D. S. Richards, and P. Winter. The Steiner Tree Problem. Number 53 in Annals of Discrete Mathematics. North-Holland, 1992.
  5. F. K. Hwang. A primer of the Euclidean Steiner tree problem. Annals of Operations Research, 33:73–84, 1991. · DOI
  6. S. L. Hakimi. Steiner’s problem in graphs and its implications. Networks, 1:113–133, 1971. · DOI
  7. H. J. Prömel and A. Steger. The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity. Vieweg, Braunschweig/Wiesbaden, Germany, 2002. · DOI
  8. P. A. Thurber and G. Xue. Computing hexagonal Steiner trees using PCX. In Proceedings of the International Conference on Electronics, Circuits and Systems, pages 381–384, 1999. · DOI
  9. C. Coulston. Steiner minimal trees in a hexagonally partitioned space. International Journal of Smart Engineering System Design, 5:1–6, 2003. · DOI
  10. M. Zachariasen and P. Winter. Workshop on Algorithm Engineering and Experimentation, Lecture Notes in Computer Science, Volume 1619, Chapter: Obstacle-avoiding Euclidean Steiner trees in the plane: An exact algorithm, pages 282–295. Springer-Verlag GmbH, 1999. · DOI
  11. I. Frommer, B. Golden, and G. Pundoor. The Next Wave in Computing, Optimization, and Decision Technologies, Chapter: Heuristic methods for solving Euclidean non-uniform Steiner tree problems, pages 133–148. Springer, New York, 2005. · DOI
  12. Y. Kanemoto, R. Sugawara, and M. Ohmura. A genetic algorithm for the rectilinear Steiner tree in 3-D VLSI layout design. In Proceedings of the 47th IEEE International Midwest Symposium on Circuits and Systems, pages I-465–I-468, 2004. · DOI
  13. C. Stanton and J. M. Smith. Steiner trees and 3-D macromolecular conformation. INFORMS Journal on Computing, 16(4):470–485, 2004. · DOI
  14. R. Karp. Complexity of Computer Computations, Chapter: Reducibility among combinatorial problems, pages 85–103. Plenum Press, New York, 1972. · DOI · Paper page
  15. M.R. Garey, R.L. Graham, and D.S. Johnson. The complexity of computing Steiner minimal trees. SIAM Journal on Applied Mathematics, 32:835–859, 1977. · DOI
  16. C. Gröpl, S. Hougardy, T. Nierhoff, and H. J. Prömel, Steiner Trees in Industry. Chapter: Approximation algorithms for the Steiner tree problem in graphs. Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001.
  17. J. Barreiros. An hierarchic genetic algorithm for computing (near) optimal Euclidean Steiner trees. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 56–65, 2003.
  18. C. C. Ribeiro and M. C. de Souza. Tabu search for the Steiner problem in graphs. Networks, 36(2):138–146, 2000. · DOI
  19. L. J. Osborne and B. E. Gillett. A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks. ORSA Journal on Computing, 3:213–225, 1991. · DOI
  20. B. A, Julstrom. A scalable genetic algorithm for the rectilinear Steiner problem. In Proceedings of the 2002 Congress on Evolutionary Computation, pages 1169–1173, 2002. · DOI
  21. B. A. Julstrom. A hybrid evolutionary algorithm for the rectilinear Steiner problem. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 49–55, 2003.
  22. C. Duin. Steiner’s problem in graphs. PhD thesis, University of Amsterdam, Amsterdam, the Netherlands, 1993.
  23. G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In Symposium on Discrete Algorithms, pages 770–779, 2000.
  24. T. Koch and A. Martin. Solving Steiner tree problems in graphs to optimality. Networks, 32:207–232, 1998. · DOI
  25. T. Polzin and S. Vahdati. Improved algorithms for the Steiner problem in networks. Discrete Applied Mathematics, 112(1–3):263–300, 2001. · DOI
  26. S. Dreyfus and R. Wagner. The Steiner tree problem in graphs. Networks, 1:195–207, 1972. · DOI
  27. I. Frommer. Modeling and Optimization of Transmission Networks. PhD thesis, University of Maryland, College Park, MD, USA, 2005.
  28. M. Mitchell. An Introduction to Genetic Algorithms. The MIT Press, Cambridge, MA. 1998. · DOI · Paper page
  29. R. Floyd. Algorithm 97 (SHORTEST PATH). Communications of the Association for Computing Machinery, 5:345, 1962. · DOI
  30. R. Prim. Shortest connection networks and some generalizations. Bell Systems Technical Journal, 36:1389–1401, 1957. · DOI
  31. S. H. Jung. Queen-bee evolution in genetic algorithms. IEEE Electronic Letters, 39:575–576, 2003. · DOI
  32. A. Mitchell. The ESRI Guide to GIS, Volume I: Geographic Patterns and Relationships. ESRI Press, Redlands, California, 1999.
  33. B. Huang, R. L. Chen, and Y. S. Liew. GIS and genetic algorithms for HAZMAT route planning with security considerations. International Journal of Geographical Information Science, 18(8):769–787, 2004. · DOI

Cited by

Sorted by citations

See all 3

Metadata

Authors
Frommer, I., & Golden, B.
Venue
Operations Research/Computer Science Interfaces Series
Publisher
Springer US
Published
2007
Pages
31-48
DOI
10.1007/978-0-387-48793-9_3
Cited by
3
References
0
Language
en

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