On the Advantage over Random for Maximum Acyclic Subgraph

Moses Charikar, Konstantin Makarychev, Yury Makarychev. On the Advantage over Random for Maximum Acyclic Subgraph. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings. pages 625-633, IEEE Computer Society, 2007. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.