| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524220 | Operations Research Letters | 2005 | 8 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Pawel Winter, Martin Zachariasen,