Worst-case ratios of networks in the rectilinear plane

Networks

Volumn 38, Issue 3, 2001, Pages 126-139

  Brenner, Ulrich ^a   Vygen, Jens ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Rectilinear network; Spanning tree; Steiner ratio; Steiner tree

Indexed keywords

EID: 0035486006     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.1031     Document Type: Article

References (15)

1. [1] C.J. Alpert, A.B. Kahng, and S.-Z. Yao, Spectral partitioning: The more eigenvectors, the better, Discr Appl Math 90 (1999), 3-26.
2. [2] M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, and R.E. Tarjan, Time bounds for selection, J Comput Syst Sci 7 (1973), 448-461.
3. [3] S. Chaudhuri, K.V. Subrahmanyam, F. Wagner, and C.D. Zaroliagis, Computing mimicking networks, Algorithmica 26 (2000), 31-49.
4. [4] F.R.K. Chung and R.L. Graham, On Steiner trees for bounded point sets, Geom Ded 11 (1981), 353-361.
5. [5] F.R.K. Chung and F.K. Hwang, The largest minimal rectilinear Steiner trees for a set of n points enclosed in a rectangle with given perimeter, Networks 9 (1979), 19-36.
6. [6] S.P. Fekete and H. Meijer, On minimum stars, minimum Steiner stars, and maximum matchings, Discr Comput Geom 23 (2000), 389-407.
7. [7] M.R. Garey and D.S. Johnson, The rectilinear Steiner tree problem is NP-complete, SIAM J Appl Math 32 (1977), 826-834.
8. [8] M. Hanan, On Steiner's problem with rectilinear distance, SIAM J Appl Math 14 (1966), 255-265.
9. [9] F.K. Hwang, On Steiner minimal trees with rectilinear distance, SIAM J Appl Math 30 (1976), 104-114.
10. [10] E. Ihler, F. Wagner, and D. Wagner, Modeling hypergraphs by graphs with the same mincut properties, Info Process Lett 45 (1993), 171-175.
11. [11] T. Lengauer, Combinatorial algorithms for integrated circuit layout, Wiley, Chichester 1990.
12. [12] M.I. Shamos and D. Hoey, Closest-point problems, Proc 16th Annual IEEE Symp on Foundations of Computer Science, 1975, pp. 151-162.
13. [13] A. Tamir and J.S.B. Mitchell, A maximum b-matching problem arising from median location models with application to the roommates problem, Math Prog 80 (1998), 171-194.
14. [14] J. Vygen, Algorithms for large-scale flat placement, Proc 34th Design Automation Conf, 1997, pp. 746-751.
15. [15] D. M. Warme, P. Winter, and M. Zachariasen, "Exact algorithms for plane Steiner tree problems: A computational study," Advances in Steiner trees, D.Z. Du, J.M. Smith, and J.H. Rubinstein (Editors), Kluwer, Boston, 2000, pp. 81-116.