Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph.

Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra

Browse the full FOCS paper archive.