Two-connected Steiner networks: structural properties |
| |
| Authors: | Pawel Winter |
| |
| Affiliation: | Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen Ø, Denmark |
| |
| 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: | Survivable networks 2-connected Steiner networks |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
