Min-Cost 2-Connected Subgraphs With k Terminals
| dc.creator | Chekuri, Chandra | |
| dc.creator | Korula, Nitish | |
| dc.date | 2008-02-18 | |
| dc.date.accessioned | 2026-07-07T09:21:34Z | |
| dc.date.available | 2026-07-07T09:21:34Z | |
| dc.description | In the k-2VC problem, we are given an undirected graph G with edge costs and an integer k; the goal is to find a minimum-cost 2-vertex-connected subgraph of G containing at least k vertices. A slightly more general version is obtained if the input also specifies a subset S \subseteq V of terminals and the goal is to find a subgraph containing at least k terminals. Closely related to the k-2VC problem, and in fact a special case of it, is the k-2EC problem, in which the goal is to find a minimum-cost 2-edge-connected subgraph containing k vertices. The k-2EC problem was introduced by Lau et al., who also gave a poly-logarithmic approximation for it. No previous approximation algorithm was known for the more general k-2VC problem. We describe an O(\log n \log k) approximation for the k-2VC problem. | |
| dc.description | 18 pages, 3 figures | |
| dc.identifier | https://arxiv.org/abs/0802.2528 | |
| dc.identifier | http://arxiv.org/abs/0802.2528 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/155069 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | F.2.2 | |
| dc.title | Min-Cost 2-Connected Subgraphs With k Terminals | |
| dc.type | text |