Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph | IEEE Conference Publication | IEEE Xplore