5595 search results - page 89 / 1119 » Approximation Algorithms for Clustering Problems |
159
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
160
click to vote
NETWORKS
2006
15 years 4 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
171
Voted
SODA
1992
ACM
15 years 5 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
190
click to vote
IFIPTCS
2010
15 years 2 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
131
click to vote
IDA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The label switching problem, the unidentifiability of the permutation of clusters or more generally latent variables, makes interpretation of results computed with MCMC ...