Zoltan Szigeti
szigeti@ecp6.jussieu.fr
Université Paris 6
11 de setembro de 2001, às 16:00 horas
Sala 242 - A
Abstract:
We shall present some known approximation algorithms on the minimum size 2-edge-connected spanning subgraph problem. Then we shall show a new approach using ear-decompositions. Finally, the lower bounds applied in these algorithms will be compared.