An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3254, Issue , 2004, Pages 442-452

  Wang, Yin ^a   Hong, Xianlong ^a   Jing, Tong ^a   Yang, T ^b   Hu, Xiaodong ^b   Yan, Guiying ^b  

^a TSINGHUA UNIVERSITY   (China)

^b INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGRATED CIRCUIT DESIGN; OPTIMIZATION; ULSI CIRCUITS;

BOUNDED DEGREE; LARGE SCALE INTEGRATED CIRCUIT; LOW DEGREE; MINIMUM SPANNING TREES; NEIGHBORHOOD GRAPHS; PHYSICAL DESIGN; VERTEX DEGREE;

ALGORITHMS;

EID: 22544435856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30205-6_46     Document Type: Article

References (23)

1. T.Barrera, J.Griffith, et al. Toward a Steiner engine: Enhanced serial and parallel implementations of the iterated 1-steineralgorithm.In Proc.GLSVLSI,pp.90, MI, 1993.
2. D.Cheriton and R.E.Tarjan. Finding minimum spanning trees. SIAM Journal on Computing, 5(4): 724-742, Dec. 1976.
3. S.P.Fekete, S.Khuller, M.Klemmstein, et al. A network-flow technique for finding lowweight bounded-degree trees. In Proc. of International Integer Programming and Combinatorial Optimization IPCO Conference. Jun 1996. Vancouver, Canada, volume 1084, pp. 105-117.
4. G.N.Fredrickson. Data structures for on-line updating of minimum spanning trees. SIAM Journal on Computing, 14:781-798, 1985.
5. M. R. Garey and D. S. Johnson. Computers and Intractability: a Guide to the Theory of NP Completeness. W. H. Freeman, 1979.
6. G. Georgakopoulos and C. H. Papadimitriou. The 1-steiner tree problem. Journal of Algoritluns, 8: pp.122-130, 1987.
7. R.L.Graham and P.Hell. On the history of the minimum spanning tree problem. Annals of the History of Computing, 7:43-57, 1985.
8. J.Griffith, G.Robins, J.S.Salowe et al. Closing the gap: Near-optimal steiner trees in polynomial time. IEEE Trans. on CAD, 13(11):1351-1365, Nov. 1994.
9. L.J.Guibas and J.Stolfi. On computing all north-east nearest neighbors in the L1 metric. Information Processing Letters, 17, 1983.
10. F.K.Hwang. On steiner minimal trees with rectilinear distance. SIAM journal on Applied Mathematics, 30:104-114, 1976.
11. F.K.Hwang. An O(n log n) algorithm for rectilinear minimal spanning trees. Journal of the ACM, 26(2): 177-182, Apr. 1979.
12. A.B.Kahng and G.Robins. A new class of iterated Steiner tree heuristics with good performance. IEEE Irans. Computer-Aided Design, 11:893-902, 1992.
13. S.KhulIer, B.Raghavachari, and N.Young. Low degree spanning trees of small weight. SIAM Journal on Computing, 25(2):355-368, 1996.
14. M.Kruskal. On the shortest spanning subtree of a graph, and the traveling salesman problem. Proc. Amer. Math Soc., 7:48-50, 1956.
15. D.T.Lee and C.K.Wong. Voronoi diagrams in L1(L7) metric with 2-dimensional storage applications. SIAM Journal of Computing, 9:200-211, 1980.
16. C.H.Papadimitriou and U.V.Vazirani. On two geometric problems relating to the traveling salesman problem. Journal of Algorithms, 5:231-246, 1984.
17. B.T.Preas and M.J.Lorenzetti. Physical Design Automation of VLSI Systems. Benjamin/Cummings, Menlo Park, CA, 1988.
18. A.Prim. Shortest connecting networks and some generalizations. Bell Syst. Tech J., 36:1389-1401, 1957.
19. R.Ravi and J.onemann. A matter of degree: Improved approximation algorithms for degree-bounded MSTs. In Proc. ACM Symposium on Theory of Computing, 2000.
20. G.Robins and J.S.Salowe. Low-degree minimum spanning tree. Discrete and Computational Geometry, 14:151-165, Sept. 1995.
21. G.M.Shute, L.L.Deneen, and C.D.Thomborson. An O(n log n) plane-sweep algorithm for L1 and L1 delaunay triangulations. Algorithmica, 6:207-221, 1991.
22. A.C.-C.Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11(4):721-736, Nov. 1982.
23. H.Zhou, N.Shenoy, and W.NicholIs. Efficient spanning tree construction without delaunay triangulation. Information Processing Letters, 81(5), 2002.