Approximating power node-deletion problems

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
On a generalization of Nemhauser and Trotter's local optimization theorem
A generalization of Nemhauser and Trotter's local optimization theorem
On bounded-degree vertex deletion parameterized by treewidth
A new approach for approximating node deletion problems
The node-deletion problem for hereditary properties is NP-complete
A unified approximation algorithm for node-deletion problems
An analysis of the greedy algorithm for the submodular set covering problem
Exact combinatorial algorithms and experiments for finding maximum $k$-plexes
On approximation of the submodular set cover problem
One for the price of two: a unified approach for approximating covering problems
Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
Randomized parameterized algorithms for $P_2$-packing and co-path packing problems
Vertex cover might be hard to approximate to within $2 - \varepsilon $
Using Homogeneous Weights for Approximating the Partial Cover Problem
Every Property of Hyperfinite Graphs Is Testable
A better approximation ratio for the vertex cover problem
The minimum generalized vertex cover problem
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Parameterized Power Vertex Cover
Covering Problems with Hard Capacities
Min-Power Covering Problems
A Linear Kernel for Co-Path/Cycle Packing
On the power of unique 2-prover 1-round games
A graph‐theoretic generalization of the clique concept
The Rectilinear Steiner Tree Problem is $NP$-Complete
Approximating Clique and Biclique Problems
A unified local ratio approximation of node-deletion problems
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
On independent sets, 2-to-2 games, and Grassmann graphs
Reducibility among Combinatorial Problems
Towards a proof of the 2-to-1 games conjecture?
A naive algorithm for feedback vertex set
Approximating Bounded Degree Deletion via Matroid Matching

This page was built for publication: Approximating power node-deletion problems