A generalization of Dijkstra’s shortest path algorithm with applications to VLSI routing. (English)
J. Discrete Algorithms 7, No. 4, 377-390 (2009).
1
Shortest paths and Steiner trees in VLSI routing. (English)
Bonn: Univ. Bonn, Mathematisch-Naturwissenschaftliche Fakultät (Dissertation). viii, 126~p. (2007).
2
Yield improvement by local wiring redundancy (English)
ISQED, 473-478 (2006).
3
Delay-related secondary objectives for rectilinear Steiner minimum trees. (English)
Discrete Appl. Math. 136, No. 2-3, 271-298 (2004).
4
Approximation of rectilinear Steiner trees with length restrictions on obstacles. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 8th international workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 ‒ August 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40545-3/pbk). Lect. Notes Comput. Sci. 2748, 207-218 (2003).
5
Approximation of rectilinear Steiner trees with length restrictions on obstacles (English)
WADS, 207-218 (2003).
6
Start
Contact
Print
General Help
