BibTeX
@inproceedings{DBLP:conf/focs/GuruswamiMR08,
author = {Venkatesan Guruswami and
Rajsekar Manokaran and
Prasad Raghavendra},
title = {Beating the Random Ordering is Hard: Inapproximability of
Maximum Acyclic Subgraph},
booktitle = {FOCS},
year = {2008},
pages = {573-582},
ee = {http://dx.doi.org/10.1109/FOCS.2008.51},
crossref = {DBLP:conf/focs/2008},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/focs/2008,
title = {49th Annual IEEE Symposium on Foundations of Computer Science,
FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA},
booktitle = {FOCS},
publisher = {IEEE Computer Society},
year = {2008},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2008-12-23 by Michael Ley (ley@uni-trier.de)