RETRACTED ARTICLE: On the survivable network design problem with mixed connectivity requirements
نویسندگان
چکیده
منابع مشابه
On the Survivable Network Design Problem with Mixed Connectivity Requirements
A graph is said to be (k, l)-connected if the resulted graph after removing of any k vertices and (l−1) edges or removing of any (k−1) vertices and l edges is still connected. Beineke and Harary (1967) (see [1]) claimed to prove that there should be k+ l edge-disjoint paths, of which k are vertex-disjoint, between any pair of vertices if the graph has (k, l)-connectivity. However, Mader (1979) ...
متن کاملConnectivity-splitting models for survivable network design
The survivable network design (SND) problem seeks a minimum cost robust network configuration that provides a specified number of alternate (edge-disjoint) paths between nodes of the network. For this problem, we present a family of new mixed integer programming formulations whose associated linear programming relaxations can be tighter than that of the usual cutset formulation. The new formula...
متن کاملConnectivity Upgrade Models for Survivable Network Design
Infrastructure networks to transport material, energy, and information are critical for today’s interconnected economies and communities, and network disruptions and failures can have serious economic and even catastrophic consequences. Since these networks require enormous investments, network service providers emphasize both survivability and cost-effectiveness in their network design decisio...
متن کاملThe Two-Edge Connectivity Survivable Network Problem in Planar Graphs
Consider the following problem: given a graph with edgeweights and a subset Q of vertices, find a minimum-weight subgraph in which there are two edge-disjoint paths connecting every pair of vertices in Q. The problem is a failure-resilient analog of the Steiner tree problem, and arises in telecommunications applications. A more general formulation, also employed in telecommunications optimizati...
متن کاملA note on the Survivable Network Design Problem
In this note we consider the survivable network design problem (SNDP) in undirected graphs. We make two contributions. The first is a new counting argument in the iterated rounding based 2-approximation for edge-connectivity SNDP (EC-SNDP) originally due to Jain [Jai01]. The second is to make some additional connections between hypergraphic version of SNDP (Hypergraph-SNDP) introduced in [ZNI03...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2019
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-019-03175-5