2 search results - page 1 / 1 » Beating the Random Ordering is Hard: Inapproximability of Ma... |
FOCS
2008
IEEE
13 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:...
SODA
2012
ACM
11 years 6 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...