this book presents an up-to-date set of contributions by the most influential authors on the steiner tree problem. the authors address the latest concerns of steiner trees for their computational complexity, design of algorithms, performance guaranteed heuristics, computational experimentation, and range of applications. audience: the book is intended for advanced undergraduates, graduates and research scientists in combinational optimization and computer science. it is divided into two sections: part i includes papers on the general geometric steiner tree problem in the plane and higher dimensions; part ii includes papers on the steiner problem on graphs which has significant import to steiner tree applications.