281 search results - page 57 / 57 » Better Polynomial Algorithms on Graphs of Bounded Rank-Width |
164
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
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:...