✦ LIBER ✦

An Approximation Algorithm for the Minimum-Cost k -Vertex Connected Subgraph

✍ Scribed by Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian

Book ID: 118181136
Publisher: Society for Industrial and Applied Mathematics
Year: 2003
Tongue: English
Weight: 121 KB
Volume: 32
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539701392287

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An $O(\log^2{k})$-Approximation Algorith

An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem

✍ Fakcharoenphol, Jittat; Laekhanukit, Bundit 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 254 KB

A 2-Approximation Algorithm for Finding

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph

✍ Vincenzo Auletta; Yefim Dinitz; Zeev Nutov; Domenico Parente 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 71 KB

The problem of finding a minimum weight k-vertex connected spanning sub-Ž . graph in a graph G s V, E is considered. For k G 2, this problem is known to be NP-hard. Combining properties of inclusion-minimal k-vertex connected graphs Ž and of k-out-connected graphs i.e., graphs which contain a vertex

A Constant Factor Approximation for Mini

A Constant Factor Approximation for Minimum -Edge-Connected -Subgraph with Metric Costs

✍ Safari, MohammadAli; Salavatipour, Mohammad R. 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 445 KB

A 3-Approximation Algorithm for Finding

A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs

✍ Yefim Dinitz; Zeev Nutov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 103 KB

The problem of finding a minimum weight k-vertex connected spanning sub-Ž . graph in a graph G s V, E is considered. For k G 2, this problem is known to be NP-hard. Based on the paper of Auletta, Dinitz, Nutov, and Parente in this issue, Ä 4 we derive a 3-approximation algorithm for k g 4, 5 . This

An Algorithm for Minimum Cost Arc-Connec

An Algorithm for Minimum Cost Arc-Connectivity Orientations

✍ Satoru Iwata; Yusuke Kobayashi 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 378 KB

A linear time 53-approximation for the m

A linear time 53-approximation for the minimum strongly-connected spanning subgraph problem

✍ Liang Zhao; Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 134 KB

A linear time 5 3 -approximation algorithm is presented for the NP-hard problem of finding a minimum strongly-connected spanning subgraph. It is based on cycle contraction that was first introduced by Khuller, Raghavachari and Young [SIAM J. Comput. 24 (1995) 859-872]. We improve their result by con