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
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms and Metaheuristics covers fundamental, theoretical topics as well as ad
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 is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set. It can also be regarded as a stand-alone volume presenting