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 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

This book constitutes the refereed proceedings of the 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002, held in Turku, Finland, in July 2002. The 43 rev

One of Springer’s renowned Major Reference Works, this awesome achievement provides a comprehensive set of solutions to important algorithmic problems for stu

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