Abstract
This paper is concerned with the polynomial time approximability of node-deletion problems for hereditary properties. We will focus on such graph properties that are derived from matroids definable on the edge set of any graph. It will be shown first that all the node-deletion problem for such properties can be uniformly formulated by a simple but non-standard form of the integer program. A primaldual approximation algorithm based on this and the dual of its linear relaxation is then presented.
When a property has infinitely many minimal forbidden graphs no constant factor approximation for the corresponding node-deletion problem has been known except for the case of the Feedback Vertex Set (FVS) problem in undirected graphs. It will be shown next that FVS is not the sole exceptional case and that there exist infinitely many graph (hereditary) properties with an infinite number of minimal forbidden graphs, for which the node-deletion problems are efficiently approximable to within a factor of 2. Such properties are derived from the notion of matroidal families of graphs and relaxing the definitions for them.
This work is partially supported by a grant from the Okawa Foundation for Information and Telecommunications.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Arora, C. Lund. R. Motwani. M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In 33rd FOCS, pages 14–23. 1992.
T. Andreae. Matroidal families of finite connected nonhomeomorphic graphs exist. J. of Graph Theory. 2:149–153, 1978.
V. Bafna, P. Berman, and T. Fujito. Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs. In ISAAC '95. pages 142–151, 1995.
R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. In Annals of Discrete Mathematics, volume 25, pages 27–46. North-Holland, 1985.
A. Becker and D. Geiger. Approximation algorithms for the loop cutset problem. In Proc. of the 10th conference on Uncertainty in Artificial Intelligence, pages 60–68, 1994.
R. Bar-Yehuda, D. Geiger, J. Naor, and R. M. Roth. Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and bayesian inference. In 5th SODA, pages 344–354. 1994.
F.A. Chudak, M.X. Goemans, D.S. Hochbaum, and D.P. Williamson. A primal-dual interpretation of recent 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Manuscript. 1996.
G. Even, J. Naor, B. Schiever, and L. Zosin. Approximating minimum subset feedback sets in undirected graphs with applications. In 4th ISTCS, pages 78–88, 1996.
T. Fujito. A unified local ratio approximation of node-deletion problems. In ESA '96, pages 167–178, 1996.
F. Gavril, 1974. cited in [GJ79, page 134].
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and co., New York. 1979.
J. Håstad. Some optimal in-approximability results. In 29th STOC, to appear, 1997.
J.M. Lewis and M. Yannakakis. The node-deletion problem for hereditary properties is NP-complete. JCSS, 20:219–230, 1980.
C. Lund and M. Yannakakis. The approximation of maximum subgraph problems. In 20th ICALP, pages 40–51, 1993.
B. Monien and E. Speckenmeyer. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Inform., 22:115–123, 1985.
C. Papadimitriou and M. Yannakakis. Optimization, approximation and complexity classes. JCSS, 43:425–440, 1991.
J.M.S. Simões-Pereira. On subgraphs as matroid cells. Math. Z., 127:315–322, 1972.
J.M.S. Simões-Pereira. On matroids on edge sets of graphs with connected subgraphs as circuits. In Proc. Amer. Math. Soc., volume 38, pages 503–506. 1973.
D.J.A. Welsh. Matroid Theory. Academic Press, London, 1976.
M. Yannakakis. Some open problems in approximation. In CIAC '94, pages 33–39, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fujito, T. (1997). A primal-dual approach to approximation of node-deletion problems for matroidal properties. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_228
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_228
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive