Article ID: | iaor2006957 |
Country: | Netherlands |
Volume: | 33 |
Issue: | 4 |
Start Page Number: | 395 |
End Page Number: | 402 |
Publication Date: | Jul 2005 |
Journal: | Operations Research Letters |
Authors: | Winter Pawel, Zachariasen Martin |
Keywords: | graphs |
We give a number of structural results for the problem of constructing a minimum-length 2-connected network for a set of terminals in a graph, where edge-weights satisfy the triangle inequality. A new algorithmic framework, based on our structural results, is given.