74 search results - page 15 / 15 » On the Approximability of Maximum and Minimum Edge Clique Pa... |
SODA
2010
ACM
14 years 3 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
KDD
2012
ACM
11 years 8 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
INFOCOM
2010
IEEE
13 years 4 months ago
2010
IEEE
—Energy conservation is drawing increasing attention in data networking. One school of thought believes that a dominant amount of energy saving comes from turning off network ele...