Finding 2-edge connected spanning subgraphs
نویسندگان
چکیده
منابع مشابه
Finding 2-edge connected spanning subgraphs
This paper studies the NP-hard problem of /nding a minimum size 2-edge connected spanning subgraph (2-ECSS). An algorithm is given that on an r-edge connected input graph G=(V; E) /nds a 2-ECSS of size at most |V |+(|E|−|V |)=(r−1). For r-regular, r-edge connected input graphs for r = 3, 4, 5 and 6, this gives approximation guarantees of 4 ; 4 3 ; 11 8 and 7 5 , respectively. c © 2003 Elsevier ...
متن کاملOn finding highly connected spanning subgraphs
In the Survivable Network Design Problem (SNDP), the input is an edge-weighted (di)graph G and an integer ruv for every pair of vertices u, v ∈ V (G). The objective is to construct a subgraph H of minimum weight which contains ruv edge-disjoint (or node-disjoint) u-v paths. This is a fundamental problem in combinatorial optimization that captures numerous well-studied problems in graph theory a...
متن کاملMinimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
We present a linear time algorithm exactly solving the 2-edge connected spanning subgraph (2-ECSS) problem in a graph of bounded treewidth. Using this with Klein’s diameter reduction technique [15], we find a linear time PTAS for the problem in unweighted planar graphs, and the first PTAS for the problem in weighted planar graphs.
متن کاملGenerating k-Vertex Connected Spanning Subgraphs and k-Edge Connected Spanning Subgraphs
We show that k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k. We also show that generating k-edge connected spanning subgraphs, where k is part of the input, can be done in incremental polynomial time. These results are based on properties of minimally k-connected graphs which might be of independent interest.
متن کاملPacking of 2-Connected Spanning Subgraphs and Spanning Trees
We prove that every (6k + 2`, 2k)-connected simple graph contains k rigid and ` connected edgedisjoint spanning subgraphs. This implies a theorem of Jackson and Jordán [4] and a theorem of Jordán [6] on packing of rigid spanning subgraphs. Both these results are generalizations of the classical result of Lovász and Yemini [9] saying that every 6-connected graph is rigid for which our approach p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2004
ISSN: 0167-6377
DOI: 10.1016/j.orl.2003.08.006