On the Integrality Gap of the 2-Edge Connected Subgraph Problem ∗

@inproceedings{Alexander2006OnTI,
title={On the Integrality Gap of the 2-Edge Connected Subgraph Problem ∗},
author={A. Alexander and Sylvia C. Boyd and Paul Elliott-Magwood},
year={2006}
}

Given a complete graph on n vertices with nonnegative edge costs, the 2-edge connected subgraph problem (2EC) is that of finding a 2-edge connected multi-subgraph of minimum cost. The linear programming relaxation of this problem (2EC ) provides a lower bound for 2EC, and its study provides a promising direction for finding improved solutions for 2EC. It has been conjectured that the integrality gap α2EC between 2EC and 2EC is 4 3 . Note that this is closely related to the well-known conjecture… CONTINUE READING