Bottleneck Steiner trees in the plane
- 1 March 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 41 (3) , 370-374
- https://doi.org/10.1109/12.127452
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- A powerful global router: based on Steiner min-max treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Minimum Cuts for Circular-Arc GraphsSIAM Journal on Computing, 1990
- Geometric complexity of some location problemsAlgorithmica, 1986
- Competitive location strategies for two facilitiesRegional Science and Urban Economics, 1982
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982
- Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage ApplicationsSIAM Journal on Computing, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- An O ( n log n ) Algorithm for Rectilinear Minimal Spanning TreesJournal of the ACM, 1979
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972