Hitting Diamonds and Growing Cacti - Computer Science > Data Structures and AlgorithmsReport as inadecuate




Hitting Diamonds and Growing Cacti - Computer Science > Data Structures and Algorithms - Download this document for free, or read online. Document in PDF available to download.

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.



Author: Samuel Fiorini, Gwenaƫl Joret, Ugo Pietropaoli

Source: https://arxiv.org/



DOWNLOAD PDF




Related documents