Hitting Diamonds and Growing Cacti - Computer Science > Data Structures and AlgorithmsReportar como inadecuado




Hitting Diamonds and Growing Cacti - Computer Science > Data Structures and Algorithms - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We consider the following NP-hard problem: in a weighted graph, find aminimum cost set of vertices whose removal leaves a graph in which no twocycles share an edge. We obtain a constant-factor approximation algorithm,based on the primal-dual method. Moreover, we show that the integrality gap ofthe natural LP relaxation of the problem is \Theta\log n, where n denotes thenumber of vertices in the graph.



Autor: Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli

Fuente: https://arxiv.org/



DESCARGAR PDF




Documentos relacionados