Sciweavers

Share
ICCAD
1999
IEEE

A new heuristic for rectilinear Steiner trees

9 years 2 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been devoted to designing good heuristics and approximation algorithms; to date, the champion in solution quality among RST heuristics is the Batched Iterated 1-Steiner (BI1S) heuristic of Kahng and Robins. In a recent development, exact RST algorithms have witnessed spectacular progress: The new release of the GeoSteiner code of Warme, Winter, and Zachariasen has average running time comparable to that of the fastest available BI1S implementation, due to Robins. We are thus faced with the paradoxical situation that an exact algorithm for an NP-hard problem is competitive in speed with a state-of-the-art heuristic for the problem. The main contribution of this paper is a new RST heuristic, which has at its core a recent 3=2 approximation algorithm of Rajagopalan and Vazirani for the metric Steiner tree problem on ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle
Added 03 Aug 2010
Updated 03 Aug 2010
Type Conference
Year 1999
Where ICCAD
Authors Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganley
Comments (0)
books