2-Change for k-connected networks

Authors:
Michel X. Goemans;Kalyan T. Talluri
Affiliations:
Operations Research Center, Room E40-170, Massachusetts Institute of Technology, Cambridge, MA 02139, USA;Operations Research Center, Room E40-170, Massachusetts Institute of Technology, Cambridge, MA 02139, USA
Venue:
Operations Research Letters
Year:
1991

Citing 5
Cited 0

Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations

Information Processing Letters
A non-Hamiltonian, nondegenerate Delaunay Triangulation

Information Processing Letters
Minimum-weight two-connected spanning networks

Mathematical Programming: Series A and B
Toughness and Delaunay triangulations

Discrete & Computational Geometry
On the parsimonious property of connectivity problems

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of designing a k-connected network at minimum weight. We show that a 2-change transformation can always be applied when k is even. As a result, for k even, no two edges of a minimum weight k-connected network are crossing when the vertices are points in the Euclidean plane. A similar result for a linear programming relaxation of this network design problem is shown to be valid for all k.