Search Results - "Grinberg, Vadim"

How to Hide a Clique? by Feige, Uriel, Grinberg, Vadim

“…In the well known planted clique problem, a clique (or alternatively, an independent set) of size k is planted at random in an Erdos-Renyi random G ( n ,  p )…”
Get full text

How to hide a clique? by Feige, Uriel, Grinberg, Vadim

“…In the well known planted clique problem, a clique (or alternatively, an independent set) of size $k$ is planted at random in an Erdos-Renyi random $G(n, p)$…”
Get full text

Approximating Star Cover Problems by Gamlath, Buddhima, Grinberg, Vadim

“…Given a metric space $(F \cup C, d)$, we consider star covers of $C$ with balanced loads. A star is a pair $(f, C_f)$ where $f \in F$ and $C_f \subseteq C$,…”
Get full text

A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest $k$-Subgraph and Other Problems by Chuzhoy, Julia, Dalirrooyfard, Mina, Grinberg, Vadim, Tan, Zihan

“…We propose a new conjecture on hardness of low-degree $2$-CSP's, and show that new hardness of approximation results for Densest $k$-Subgraph and several other…”
Get full text