A unified approximation algorithm for node-deletion problems
type: Item
instance of: scholarly article
title: A unified approximation algorithm for node-deletion problems
zbMATH Open document ID: 0906.68106
DOI: 10.1016/S0166-218X(98)00035-3
author: Toshihiro Fujito
published in: Discrete Applied Mathematics
publication date: 1999-01-25T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 1218509
zbMATH Keywords: node-deletion problem
MaRDI profile type: Publication
cites work: Q4230322
cites work: Q3221758
cites work: Q3128894
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Approximating minimum feedback sets and multicuts in directed graphs
cites work: Q4198056
cites work: Some simplified NP-complete graph problems
cites work: Q4526964
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: On the Fractional Solution to the Set Covering Problem
cites work: Node-Deletion NP-Complete Problems
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: The approximation of maximum subgraph problems
cites work: Ramsey numbers and an approximation algorithm for the vertex cover problem
cites work: Optimization, approximation, and complexity classes
cites work: Packing directed circuits fractionally
cites work: Q4111952
cites work: Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
description: scientific article; zbMATH DE number 1218509