✦ LIBER ✦

Iterated Rounding Algorithms for the Smallest k -Edge Connected Spanning Subgraph

✍ Scribed by Gabow, Harold N.; Gallagher, Suzanne R.

Book ID: 118159065
Publisher: Society for Industrial and Applied Mathematics
Year: 2012
Tongue: English
Weight: 897 KB
Volume: 41
Category: Article
ISSN: 0097-5397
DOI: 10.1137/080732572

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating the smallest k-edge connec

Approximating the smallest k-edge connected spanning subgraph by LP-rounding

✍ Harold N. Gabow; Michel X. Goemans; Éva Tardos; David P. Williamson 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 196 KB

An Improved Analysis for Approximating t

An Improved Analysis for Approximating the Smallest k -Edge Connected Spanning Subgraph of a Multigraph

✍ Gabow, Harold N. 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 221 KB

A bad example for the iterative rounding

A bad example for the iterative rounding method for mincost -connected spanning subgraphs

✍ Ashkan Aazami; Joseph Cheriyan; Bundit Laekhanukit 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 596 KB

Ambivalent Data Structures for Dynamic 2

Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees

✍ Frederickson, Greg N. 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 730 KB

A branch-and-cut algorithm for the k-edg

A branch-and-cut algorithm for the k-edge connected subgraph problem

✍ F. Bendali; I. Diarrassouba; A.R. Mahjoub; M. Didi Biha; J. Mailfert 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB 👁 1 views

A Better Approximation Ratio for the Min

A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem

✍ Cristina G Fernandes 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Consider the minimum size k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, find a k-edge-connected spanning subgraph of G with the minimum number of edges. This problem is known to be NP-complete. Khuller and Raghavachari presented the first algo