Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs

Authors:
Pawel Winter
Affiliations:
-
Venue:
Discrete Applied Mathematics - Special issue on new frontiers in the theory and practice of combinatorial optimization: applications in manufacturing and VLSI design
Year:
1993

Citing 0
Cited 3

Short trees in polygons

Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm

ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
A 4-geometry maze router and its application on multiterminal nets

ACM Transactions on Design Automation of Electronic Systems (TODAES)

Quantified Score

Hi-index	0.00

Visualization

Abstract