An application of duality to edge-deletion problems
SIAM Journal on Computing
The algorithmic aspects of the regularity lemma
Journal of Algorithms
Regular Article: On the Complexity of DNA Physical Mapping
Advances in Applied Mathematics
MAX-CUT has a randomized approximation scheme in dense graphs
Random Structures & Algorithms
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
Polynomial time approximation schemes for dense instances of NP -hard problems
Journal of Computer and System Sciences
Random sampling and approximation of MAX-CSP problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Parameterized Complexity of Finding Subgraphs with Hereditary Properties
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Edge-deletion and edge-contraction problems
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The regularity lemma and approximation schemes for dense problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
An Optimal Algorithm for Checking Regularity
SIAM Journal on Computing
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Testing versus estimation of graph properties
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Integer and fractional packing of families of graphs
Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Density Conditions For Triangles In Multipartite Graphs
Combinatorica
Property testing in hypergraphs and the removal lemma
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Hardness of fully dense problems
Information and Computation
The maximum edit distance from hereditary graph properties
Journal of Combinatorial Theory Series B
What is the furthest graph from a hereditary property?
Random Structures & Algorithms
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Journal of Computer and System Sciences
Approximating the distance to properties in bounded-degree and general sparse graphs
ACM Transactions on Algorithms (TALG)
Hardness of edge-modification problems
Theoretical Computer Science
On the complexity of some subgraph problems
Discrete Applied Mathematics
Parameterized complexity of eulerian deletion problems
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
The approximate rank of a matrix and its algorithmic applications: approximate rank
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
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 \rm E^1p (G). The first result of this paper states that the edge-deletion problem can be efficiently approximated for any monotone property.For any \in 0 and any monotone property P, there is a deterministic algorithm, which given a graph G of size n, approximates {\rm E}^1 _p (G)\, in time O(n^2) to within an additive error of \in n^2 .Given the above, a natural question is for which monotone properties one can obtain better additive approximations of \rm E^1 _p. Our second main result essentially resolves this problem by giving a precise characterization of the monotone graph properties for which such approximations exist.1. If there is a bipartite graph that does not satisfy P, then there is a \delta 0 for which it is possible to approximate \rm E^1p to within an additive error of n^2-\delta in polynomial time.2.On the other hand, if all bipartite graphs satisfy P, then for any \delta 0 it is NP-hard to approximate \rm E^1 _p to within an additive error of n^2-\delta.While the proof of (1) is simple, the proof of (2) requires several new ideas and involves tools from Extremal Graph Theory together with spectral techniques. This approach may be useful for obtaining other hardness of approximation results. Interestingly, prior to this work it was not even