loading...
On the Advantage over Random for Maximum Acyclic Subgraph
Providence, Rhode Island October 21-October 23
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2007.6548th Annual IEEE Symposium on Foundat ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Moses Charikar, Konstantin Makarychev, Yury Makarychev, "On the Advantage over Random for Maximum Acyclic Subgraph," Foundations of Computer Science, Annual IEEE Symposium on, pp. 625-633, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/FOCS.2007.65,
author = {Moses Charikar and Konstantin Makarychev and Yury Makarychev},
title = {On the Advantage over Random for Maximum Acyclic Subgraph},
journal ={Foundations of Computer Science, Annual IEEE Symposium on},
volume = {0},
year = {2007},
issn = {0272-5428},
pages = {625-633},
doi = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2007.65},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, Annual IEEE Symposium on
TI - On the Advantage over Random for Maximum Acyclic Subgraph
SN - 0272-5428
SP625
EP633
A1 - Moses Charikar,
A1 - Konstantin Makarychev,
A1 - Yury Makarychev,
PY - 2007
KW - null
VL - 0
JA - Foundations of Computer Science, Annual IEEE Symposium on
ER -
 
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.
Citation:
Moses Charikar, Konstantin Makarychev, Yury Makarychev, "On the Advantage over Random for Maximum Acyclic Subgraph," focs, pp.625-633, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.