113
Voted
WALCOM
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
123
Voted
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...