Additive approximation for edge-deletion problems
Preprint
Abstract
A graph property is monotone if it is closed under removal of vertices and edges. In this paper we consider the following edge-deletion problem; given a monotone property P and a graph G, compute the smallest number of edge deletions that are needed in order to turn G into a graph satisfying P. We denote this quantity by E_P(G). Our first result states that for any monotone graph property P, any \epsilon >0 and n-vertex input graph G one can approximate E_P(G) up to an additive error of \epsilon n^2 Our second main result shows that such approximation is essentially best possible and for most properties, it is NP-hard to approximate E_P(G) up to an additive error of n^{2-\delta}, for any fixed positive \delta. The proof requires several new combinatorial ideas and involves tools from Extremal Graph Theory together with spectral techniques. Interestingly, prior to this work it was not even known that computing E_P(G) precisely for dense monotone properties is NP-hard. We thus answer (in a strong form) a question of Yannakakis raised in 1981.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Density Conditions For Triangles In Multipartite GraphsCombinatorica, 2006
- Integer and fractional packing of families of graphsRandom Structures & Algorithms, 2004
- Integer and Fractional Packings in Dense GraphsCombinatorica, 2001
- Parameterized Complexity of Finding Subgraphs with Hereditary PropertiesLecture Notes in Computer Science, 2000
- Quick Approximation to Matrices and ApplicationsCombinatorica, 1999
- On the Complexity of DNA Physical MappingAdvances in Applied Mathematics, 1994
- Edge-maximal triangulated subgraphs and heuristics for the maximum clique problemNetworks, 1994
- On the connection between chromatic number, maximal clique and minimal degree of a graphDiscrete Mathematics, 1974
- On a valence problem in extremal graph theoryDiscrete Mathematics, 1973
- On extremal problems of graphs and generalized graphsIsrael Journal of Mathematics, 1964