In recent years, algorithmic graph theory has become increasingly important as a link between discrete mathematics and theoretical computer science. This textbo

The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are req

The Steiner tree problem is one of the most important combinatorial optimization problems. It has a long history that can be traced back to the famous mathemati

The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree proble

The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a sig