
The internal Steiner tree problem: Hardness and approximations
Keywords: VLSI routing; Approximation algorithms; MAX SNP-hardness; Steiner trees; The internal Steiner tree problem; Design and analysis of algorithms