A new class of iterative Steiner tree heuristics with good performance

Andrew B. Kahng and Gabriel Robins
IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems 11:893–902, 1992

Cites:

Maintenance of a minimum spanning forest in a dynamic planar graph

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine