5595 search results - page 97 / 1119 » Approximation Algorithms for Clustering Problems |
147
click to vote
CIKM
1999
Springer
15 years 9 months ago
1999
Springer
In traditional data clustering, similarity of a cluster of objects is measured by pairwise similarity of objects in that cluster. We argue that such measures are not appropriate f...
147
click to vote
COR
2007
15 years 4 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
126
click to vote
CSC
2008
15 years 6 months ago
2008
- This paper presents two multilevel refinement algorithms for the capacitated clustering problem. Multilevel refinement is a collaborative technique capable of significantly aidin...
130
click to vote
STOC
1999
ACM
15 years 9 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
132
click to vote
FCT
2005
Springer
15 years 10 months ago
2005
Springer
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is N...