4 search results - page 1 / 1 » A near-linear constant-factor approximation for euclidean bi... |
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
ESA
2005
Springer
13 years 11 months ago
2005
Springer
Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + ) and (2+ )-approximation algorithms for the minimum Euclidean Earth Mover’s Dis...