Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > DENSEST K-SUBGRAPH:
Reports tagged with Densest k-subgraph:
TR15-074 | 29th April 2015
Mark Braverman, Young Kun Ko, Aviad Rubinstein, Omri Weinstein

#### ETH Hardness for Densest-$k$-Subgraph with Perfect Completeness

We show that, assuming the (deterministic) Exponential Time Hypothesis, distinguishing between a graph with an induced $k$-clique and a graph in which all $k$-subgraphs have density at most $1-\epsilon$, requires $n^{\tilde \Omega(log n)}$ time. Our result essentially matches the quasi-polynomial algorithms of Feige and Seltser [FS97] and Barman [Bar15] for ... more >>>

TR16-195 | 19th November 2016
Pasin Manurangsi

#### Almost-Polynomial Ratio ETH-Hardness of Approximating Densest $k$-Subgraph

Revisions: 1

In the Densest $k$-Subgraph problem, given an undirected graph $G$ and an integer $k$, the goal is to find a subgraph of $G$ on $k$ vertices that contains maximum number of edges. Even though the state-of-the-art algorithm for the problem achieves only $O(n^{1/4 + \varepsilon})$ approximation ratio (Bhaskara et al., ... more >>>

ISSN 1433-8092 | Imprint