Two-connected Steiner networks: structural properties

Authors:
Pawel Winter;Martin Zachariasen
Affiliations:
Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen Ø, Denmark;Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen Ø, Denmark
Venue:
Operations Research Letters
Year:
2005

Citing 3
Cited 4

Minimum-weight two-connected spanning networks

Mathematical Programming: Series A and B
Spanning trees in hypergraphs with applications to steiner trees

Spanning trees in hypergraphs with applications to steiner trees
On the structure and complexity of the 2-connected Steiner network problem in the plane

Operations Research Letters

Some structural and geometric properties of two-connected steiner networks

CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Connectivity Upgrade Models for Survivable Network Design

Operations Research
Some new structural properties of shortest 2-connected Steiner networks

FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Relay placement for two-connectivity

IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

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.