5595 search results - page 213 / 1119 » Approximation Algorithms for Clustering Problems |
154
Voted
SODA
2004
ACM
15 years 7 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
159
click to vote
ICDT
2005
ACM
15 years 11 months ago
2005
ACM
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
180
Voted
SODA
2008
ACM
15 years 7 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
204
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
353
click to vote
GECCO
2011
Springer
14 years 9 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...