5595 search results - page 233 / 1119 » Approximation Algorithms for Clustering Problems |
207
click to vote
STACS
2005
Springer
15 years 12 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
186
click to vote
ISPAN
2005
IEEE
15 years 12 months ago
2005
IEEE
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
159
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Semi-supervised classification uses aspects of both unsupervised and supervised learning to improve upon the performance of traditional classification methods. Semi-supervised clu...
168
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
251
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...