Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Guy Flysher"'
Publikováno v:
SIAM Journal on Discrete Mathematics. 24:1441-1469
We study the partial capacitated vertex cover problem (PCVC) in which the input consists of a graph $G$ and a covering requirement $L$. Each edge $e$ in $G$ is associated with a demand (or load) $\ell(e)$, and each vertex $v$ is associated with a (so
Autor:
Ilan Horn, Assaf Ben-David, David Deutscher, Ron Merom, Maayan Roth, Ari Leichtberg, Guy Flysher, Naty Leiser, Yossi Matias
Publikováno v:
KDD
Although users of online communication tools rarely categorize their contacts into groups such as "family", "co-workers", or "jogging buddies", they nonetheless implicitly cluster contacts, by virtue of their interactions with them, forming implicit