DMCA

Beating the random ordering is hard: Inapproximability of maximum acyclic subgraph

by Venkatesan Guruswami , Rajsekar Manokaran , Prasad Raghavendra
Venue:in FOCS, 2008
Citations:36 - 9 self