The approximation of maximum subgraph problems
Authors:
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 40-51
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On the hardness of approximating minimization problems1993
- On the complexity of approximating the independent set problemInformation and Computation, 1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- On Approximate Solutions for Combinatorial Optimization ProblemsSIAM Journal on Discrete Mathematics, 1990
- Edge-Deletion ProblemsSIAM Journal on Computing, 1981
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- The node-deletion problem for hereditary properties is NP-completeJournal of Computer and System Sciences, 1980
- Node-Deletion NP-Complete ProblemsSIAM Journal on Computing, 1979
- The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph ProblemsJournal of the ACM, 1979
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976