A fast multilayer general area router for MCM designs
EURO-DAC '92 Proceedings of the conference on European design automation
A negative reinforcement method for PGA routing
DAC '93 Proceedings of the 30th international Design Automation Conference
A new generalized row-based global router
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
| Hi-index | 0.00 |
Clark Thompson recently suggested a very natural "greedy" heuristic for the rectilinear Steiner problem (RSP), analogous to Kruskal''s algorithm for the minimum spanning tree problem. We study this heuristic by comparing the solutions it finds with rectilinear minimum spanning trees. We first prove a theoretical result on instances of RSP consisting of a large number of random points in the unit square. Thompson''s heuristic produces a tree expected length some fraction shorter than a minimum spanning tree. The second part of this paper studies Thompsons''s heuristic experimentally and finds that it gives solutions about 9% shorter than minimum spanning trees on medium size problems (40-100 nodes). this performance is very similar to that of other RSP heuristics described in the literature.