Publications of M. Conforti

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  ALL, with author Conforti M., in the category IASI Research Reports (or show them all):


IASI Research Report n. 583  (Previous )  

Conforti M., Anna Galluccio, Guido Proietti

Augmentation problems and network matrices

ABSTRACT
We study the following NP-hard graph augmentation problem: Given a weighted graph G and a connected spanning subgraph H of G, find a minimum weight set of edges of G to be added to H so that H becomes 2-edge-connected. We provide a formulation of the problem as a set covering problem and we exhibit instances in which the Linear Programming Relaxation of our formulation always gives an integer solution. This yields instances of the problem that can be solved in polynomial time, and suggests an interesting application for solving efficiently a survivability problem on communication networks. Finally, we present a 2-approximation algorithm for integer programs with constraint set defi ned by graphic matrices.
back
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -