A unified approximation algorithm for node-deletion problems
From MaRDI portal
Publication:1270821
DOI10.1016/S0166-218X(98)00035-3zbMath0906.68106MaRDI QIDQ1270821
Publication date: 25 January 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
68R10: Graph theory (including graph drawing) in computer science
05B35: Combinatorial aspects of matroids and geometric lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ramsey numbers and an approximation algorithm for the vertex cover problem
- The node-deletion problem for hereditary properties is NP-complete
- Optimization, approximation, and complexity classes
- Some simplified NP-complete graph problems
- Approximating minimum feedback sets and multicuts in directed graphs
- Packing directed circuits fractionally
- On the Fractional Solution to the Set Covering Problem
- Node-Deletion NP-Complete Problems
- A Greedy Heuristic for the Set-Covering Problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- The approximation of maximum subgraph problems