Additive approximation for edge-deletion problems

Authors:
Noga Alon;Asaf Shapira;Benny Sudakov
Affiliations:
Tel Aviv University, Tel Aviv, Israel;Tel Aviv University, Tel Aviv, Israel;Princeton University and IAS, Princeton, NJ
Venue:
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Year:
2006

Citing 8
Cited 0

The algorithmic aspects of the regularity lemma

Journal of Algorithms
Polynomial time approximation schemes for dense instances of NP -hard problems

Journal of Computer and System Sciences
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
Random sampling and approximation of MAX-CSPs

Journal of Computer and System Sciences - STOC 2002
Every monotone graph property is testable

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Ranking Tournaments

SIAM Journal on Discrete Mathematics
Graph limits and parameter testing

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A graph property is monotone if it is closed under removal of vertices and edges. We consider the following algorithmic problem, called the 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 the edge-deletion problem can be efficiently approximated for any monotone property.