The Community for Technology Leaders
RSS Icon
Subscribe
Providence, Rhode Island
Oct. 21, 2007 to Oct. 23, 2007
ISBN: 0-7695-3010-9
pp: 625-633
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.
INDEX TERMS
null
CITATION
Moses Charikar, Konstantin Makarychev, Yury Makarychev, "On the Advantage over Random for Maximum Acyclic Subgraph", FOCS, 2007, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2007, pp. 625-633, doi:10.1109/FOCS.2007.65
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool