Sciweavers

FOCS
2007
IEEE

On the Advantage over Random for Maximum Acyclic Subgraph

14 years 5 months ago
On the Advantage over Random for Maximum Acyclic Subgraph
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 edges, our algorithm finds an acyclic subgraph with 1/2 + Ω(δ/ log n) fraction of all edges.
Moses Charikar, Konstantin Makarychev, Yury Makary
Added 02 Jun 2010
Updated 02 Jun 2010
Type Conference
Year 2007
Where FOCS
Authors Moses Charikar, Konstantin Makarychev, Yury Makarychev
Comments (0)