Thirty‐five‐point rectilinear steiner minimal trees in a day

Networks

Volumn 25, Issue 2, 1995, Pages 69-87

  Salowe, Jeffrey S ^a,c   Warme, David M ^b  

^a UNIVERSITY OF VIRGINIA   (United States)

^b Telenex Corporation ^*  (United States)

^c Questech Inc ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21844517252     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.3230250206     Document Type: Article

References (30)

1. Algorithms for the special cases of rectilinear Steiner trees: I. Points on the boundary of a rectilinear rectangle
2. On the average number of maxima in a set of vectors and applications
3. On Steiner trees for bounded sets
4. Exact computation of Steiner minimal trees in the plane
5. Improved computation of plane Steiner minimal trees
6. An optimal Steiner tree routing algorithm for a net whose terminals lie on the perimeter of a rectangle
7. A probably fast, provably optimal algorithm for rectilinear Steiner trees
8. Network flow and testing graph connectivity
9. The rectilinear Steiner problem is NP‐complete
10. Fast algorithms for direct enclosures and direct dominances
11. On Steiner's problem with rectilinear distance
12. Dividing a graph into triconnected components
13. On Steiner minimal trees with rectilinear distance
14. Steiner tree problems
15. A new class of iterative Steiner tree heuristics with good performance
16. Probabilistic partitioning algorithms for the rectilinear Steiner problem
17. On the problem of Steiner
18. A heuristic algorithm for small separators in arbitrary graphs
19. A linear‐time algorithm to construct a rectilinear Steiner minimal tree for k‐extremal point sets
20. Minimal rectilinear Steiner trees
21. An algorithm for the Steiner problem in the Euclidean plane
22. Steiner problem in networks: A survey