Two-connected networks with rings of bounded cardinality
We study the problem of designing at minimum cost a two-connected network such that each edge belongs to a cycle using at most K edges. This problem is a particular case of the two-connected networks with bounded meshes problem studied by Fortz, LabbĂ© and Maffioli. In this paper, we compute a lower bound on the … Read more