On the Advantage over Random for Maximum Acyclic Subgraph

13 years 10 months ago

Download www.cs.princeton.edu

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 ﬁnds an acyclic subgraph with 1/2 + Ω(δ/ log n) fraction of all edges.

Moses Charikar, Konstantin Makarychev, Yury Makary

Real-time Traffic

Acyclic Subgraph | Acyclic Subgraph Problem | FOCS 2007 | Maximum Acyclic Subgraph | Theoretical Computer Science |

claim paper

» Acyclic improper colourings of graphs with bounded maximum degree

» Acyclic dominating partitions

» Exploiting Narrow Accelerators with DataCentric Subgraph Mapping

» Banditbased optimization on graphs with application to library performance tuning

» Distributed algorithms for lifetime maximization in sensor networks via MinMax spanning su...

» Twig Query Processing over GraphStructured XML Data

» Beyond Trees MRF Inference via OuterPlanar Decomposition

» Conditional Topic Random Fields

Post Info
More Details (n/a)

Added	02 Jun 2010
Updated	02 Jun 2010
Type	Conference
Year	2007
Where	FOCS
Authors	Moses Charikar, Konstantin Makarychev, Yury Makarychev

Comments (0)

Sciweavers

On the Advantage over Random for Maximum Acyclic Subgraph

Acyclic Subgraph | Acyclic Subgraph Problem | FOCS 2007 | Maximum Acyclic Subgraph | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers