Sciweavers

96 search results - page 20 / 20
» Isomorphism for Graphs of Bounded Feedback Vertex Set Number
Sort
View
FOCS
2008
IEEE
13 years 11 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...