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.

• Type: Conference
• Year: 2007
• Where: FOCS
• Authors: Moses Charikar, Konstantin Makarychev, Yury Makarychev
• Keywords: Acyclic Subgraph, Acyclic Subgraph Problem, FOCS 2007, Maximum Acyclic Subgraph, Theoretical Computer Science