Forbidden Subpaths for Steiner Minimum Networks in Uniform Orientation Metrics

Networks

Volumn 39, Issue 4, 2002, Pages 186-202

  Brazil, M ^a   Thomas, D A ^a   Weng, J F ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Fixed orientations; Steiner tree; Variational method; VLSI design

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PERTURBATION TECHNIQUES; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

ORIENTATION METRICS;

VLSI CIRCUITS;

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

References (8)

1. M. Brazil, D.A. Thomas, and J.F. Weng, Minimum networks in uniform orientation metrics, SIAM J Comput 30 (2000), 1579-1593.
2. M. Brazil, D.A. Thomas, and J.F. Weng, Exact algorithms for Steiner problems in uniform orientation metrics, in preparation.
3. D.-Z. Du and F.K. Hwang, Reducing the Steiner problem in a normed space, SIAM J Comput 21 (1992), 1001-1007.
4. F.K. Hwang, D.S. Richards, and P. Winter, "The Steiner tree problem," Annals of Discrete Mathematics, Elsevier, Amsterdam, 1992, Vol. 53.
5. D.T. Lee and C.F. Shen, The Steiner minimal tree problem in the λ-geometry plane, LNCS 1178, Alg Comput (1996), 247-255.
6. M. Sarrafzadeh and C.K. Wong, Hierarchical Steiner tree construction in uniform orientations, IEEE Trans Comput Aided Design 11 (1992), 1095-1103.
7. D. 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.
8. P. Widmayer, Y.F. Wu, and C.K. Wong, On some distance problems in fixed orientations, SIAM J Comput 16 (1987), 728-746.