k-Edge-Connectivity: Approximation and LP Relaxation

In the k-edge-connected spanning subgraph problem we are given a graph (V, E) and costs for each edge, and want to find a minimum-cost F E such that (V, F) is k-edge-connected. If P = NP, for unit costs, the best possible approximation ratio is known to be 1 + (1/k) for

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: David Pritchard
• Keywords: CORR 2010, Education, Possible Approximation Ratio, Spanning Subgraph Problem, Unit Costs