Additive approximation for edge-deletion problems

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 419-428

  Alon, Noga ^a   Shapira, Asaf ^a   Sudakov, Benny ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; DETERMINISTIC ALGORITHMS; EDGE DELETION PROBLEM; MONOTONE GRAPHS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING; THEOREM PROVING;

SIGNAL PROCESSING;

EID: 33644791095     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.11     Document Type: Conference Paper

References (40)

1. N. Alon, Ranking tournaments, to appear.
2. N. Alon, R. A. Duke, H. Lefmann, V. Rödl and R. Yuster, The algorithmic aspects of the Regularity Lemma, J. of Algorithms 16 (1994), 80-109.
3. N. Alon, W. Fernandez de la Vega, R. Kannan and M. Karpinski, Random Sampling and Approximation of MAX-CSP Problems, STOC 2002, 232-239.
4. N. Alon, E. Fischer, M. Krivelevich and M. Szegedy, Efficient testing of large graphs, Combinatorica 20 (2000), 451-476.
5. N. Alon and A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, FOCS 2005.
6. th STOC 2005, 128-137.
7. N. Alon and J. H. Spencer, The Probabilistic Method, Second Edition, Wiley, New York, 2000
8. S. Arora, A. Frieze and H. Kaplan, A new rounding procedure for the assignment problem with applications to dense graph arrangement problems, Mathematical Programming 92:1 (2002), 1-36.
9. S. Arora, D. Karger and M. Karpinski, Polynomial time approximation schemes for dense instances of graph problems, JCSS 58 (1999), 193-210.
10. T. Asano, An application of duality to edge-deletion problems, SICOMP, 16 (1987), 312-331.
11. T. Asano and T. Hirata, Edge-deletion and edge-contraction problems, STOC 1982, 245-254.
12. J. Bondy, J. Shen, S. Thomassé and C. Thomassen, Density conditions for triangles in multipartite graphs, Combinatorica, to appear.
13. J. Balogh, P. Keevash and B. Sudakov, On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs, submitted.
14. L. Cai, Fixed-parameter tractability of graph modification problems for hereditary properties, Information Processing Letters, 58 (1996), 171-176.
15. K. Cirino, S. Muthukrishnan, N. Narayanaswamy and H. Ramesh, graph editing to bipartite interval graphs: exact and asymptotic bounds, FSTTCS (1997), 37-53.
16. E. S. El-Mallah and C. J. Colbourn, The complexity of some edge-deletion problems, IEEE transactions on circuits and systems, 35 (1988), 354-362.
17. P. Erdos, On some new inequalities concerning extremal properties of graphs, Theory of Graphs (Proc. Colloq., Tihany, 1966), Academic Press, New York, 1968, 77-81.
18. P. Erdos and M. Simonovits, On a valence problem in extremal graph theory, Disc. Math. 5 (1973), 323-334.
19. W. Fernandez de la Vega, Max-Cut has a randomized approximation scheme in dense graphs, Random Structures and Algorithms, 8(3) 1996, 187-198.
20. E. Fischer and I. Newman, Testing versus estimation of graph properties, STOC 2005, 138-146.
21. A. Frieze and R. Kannan, The regularity lemma and approximation schemes for dense problems, FOCS, 1996, 12-20.
22. A. Frieze and R. Kannan, Quick approximation to matrices and applications, Combinatorica, 19(2), 1999, 175-220.
23. M.R. Garey and D.S. Johnson, Computers and Intractability: A guide to the Theory of N P-Completeness, W.H. Freeman and Co., San Francisco, 1979.
24. P. W. Goldberg, M. C. Golumbic, H. Kaplan and R. Shamir, Four strikes against physical mapping of DNA, J. of Computational Biology 2 (1995), 139-152.
25. M. C. Golumbic, H. Kaplan and R. Shamir, On the complexity of DNA physical mapping, Advances in Applied Mathematics, 15 (1994), 251-261.
26. P. E. Haxell and V. Rödl, Integer and fractional packings in dense graphs, Combinatorica 21 (2001), 13-38.
27. S. Khot and V. Raman, Parameterized complexity of finding subgraphs with hereditary properties, COCOON 2000, 137-147.
28. Y. Kohayakawa, V. Rödl and L. Thoma, An optimal algorithm for checking regularity, SIAM J. on Computing 32 (2003), no. 5, 1210-1235.
29. T. Kövari, V.T. Sós and P. Turán, On a problem of K. Zarankiewicz,Colloquium Math. 3 (1954), 50-57.
30. M. Krivelevich and B. Sudakov, Pseudo-random graphs, to appear.
31. J. Lewis and M. Yannakakis, The node deletion problem for hereditary properties is N P-complete, JCSS 20 (1980), 219-230.
32. A. Natanzon, R. Shamir and R. Sharan, Complexity classification of some edge modification problems, Discrete Applied Mathematics 113 (2001), 109-128.
33. M. Parnas, D. Ron and R. Rubinfeld, Tolerant property testing and distance approximation, manuscript, 2004.
34. J. D. Rose, A graph-theoretic study of the numerical solution of sparse positive-definite systems of linear equations, Graph Theory and Computing, R.C. Reed, ed., Academic Press, N.Y., 1972, 183-217.
35. M. Simonovits, A method for solving extremal problems in graph theory, stability problems, Theory of Graphs (Proc. Colloq., Tihany, 1966), Academic Press, New York, 1968, 279-319.
36. E. Szemerédi, Regular partitions of graphs, In: Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau, eds.), 1978, 399-401.
37. D. B. West, Introduction to Graph Theory, Prentice Hall, 2001.
38. M. Yannakakis, Edge-deletion problems, SIAM J. Comput. 10 (1981), 297-309.
39. R. Yuster, Integer and fractional packing of families of graphs, Rand. Struct, and Alg. 26 (2005), 110-118.
40. J. Xue, Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem. Networks 24, 109-120