Iterated rounding algorithms for the smallest k-edge connected spanning subgraph

  • Authors:

  • Harold N. Gabow;Suzanne Gallagher

  • Affiliations:

  • University of Colorado at Boulder, Boulder, CO;University of Colorado at Boulder, Boulder, CO

  • Venue:
  • Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present the best known algorithms for approximating the minimum cardinality undirected k-edge connected spanning subgraph. For simple graphs our approximation ratio is 1 + 1/2k + O(1/k2). The more precise version of our bound requires k ≥ 7, and for all such k it improves the longstanding bound of Cheriyan and Thurimella, 1 + 2/(k + 1) [2]. The improvement comes in two steps: First we show that for simple k-edge connected graphs, any laminar family of degree k sets is smaller than the general bound (n(1 + 3/k + O(1/k√k)) versus 2n). This immediately implies that iterated rounding improves the bound of [2]. Our second step improves iterated rounding by finding good edges for rounding. For multigraphs our approximation ratio is 1 + 21/11k k. This improves the previous bound 1 + 2/k [6]. It is of interest since it is known that for some constant c 0, an approximation ratio ≤ 1 + c/k implies P = NP. Our approximation ratio extends to the minimum cardinality Steiner network problem, where k denotes the average vertex demand. The algorithm exploits rounding properties of the first two linear programs in iterated rounding.