5595 search results - page 266 / 1119 » Approximation Algorithms for Clustering Problems |
181
click to vote
ESWA
2010
15 years 3 months ago
2010
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a gr...
192
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
236
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
173
click to vote
UAI
2008
15 years 8 months ago
2008
Exemplar-based clustering methods have been shown to produce state-of-the-art results on a number of synthetic and real-world clustering problems. They are appealing because they ...
136
click to vote
NIPS
2003
15 years 7 months ago
2003
Significant progress in clustering has been achieved by algorithms that are based on pairwise affinities between the datapoints. In particular, spectral clustering methods have ...