5595 search results - page 66 / 1119 » Approximation Algorithms for Clustering Problems |
125
click to vote
IPL
2006
15 years 4 months ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
127
click to vote
IPL
2007
15 years 4 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
134
Voted
TKDE
2008
15 years 4 months ago
2008
In this paper, we present an agglomerative fuzzy K-Means clustering algorithm for numerical data, an extension to the standard fuzzy K-Means algorithm by introducing a penalty term...
130
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
175
click to vote
MOBIHOC
2002
ACM
16 years 4 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...