On the Advantage over Random for Maximum Acyclic Subgraph

Authors:
Moses Charikar;Konstantin Makarychev;Yury Makarychev
Affiliations:
-;-;-
Venue:
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Year:
2007

Citing 0
Cited 4

Online ranking for tournament graphs

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Efficiently exploring compiler optimization sequences with pairwise pruning

Proceedings of the 1st International Workshop on Adaptive Self-Tuning Computing Systems for the Exaflop Era
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant

SIAM Journal on Computing
Sorting noisy data with partial information

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 + \delta fraction of all edges, our algorithm finds an acyclic subgraph with 1/2 + \Omega (\delta /\log n) fraction of all edges.