Sciweavers

CORR
2010
Springer
57views Education» more  CORR 2010»
14 years 1 days ago
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. I...
David Pritchard