Contents
I. Introduction
This slot is focused on an edge-based heuristic for Steiner routing (BOI),
which repeatedly includes a Steiner point by connecting a point to a
rectilinear edge with the largest wirelength saving.
II. Data Formats
To generate random pointset:
$ makerandom num_points num_instance random_seed > pointset_file
To run BOI code:
$ ratio2 < pointset_file
The program will output total wirelength of MST and BOI trees respectively.
The pointset file contains data items as:
number_of_points
x1 y1
x2 y2
.....
III. Executable Utilities
-
(makerandom)
-
-
(boi)
-
-
(zipped package)
-
-
(src code dir)
-
IV. References
-
M. Borah, R. M. Owens and M. J. Irwin.
An edge-based heuristic for Steiner routing,
IEEE Trans. on CAD, 13 (1994), pp. 1563-1568.
-
M. Borah, R. M. Owens and M. J. Irwin.
A fast and simple Steiner routing heuristic,
Discrete Applied Mathematics , 90 (1999), pp. 51-67
V. Contact
Dr. Patrick H. Madden