5595 search results - page 63 / 1119 » Approximation Algorithms for Clustering Problems |
166
click to vote
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
128
Voted
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
138
click to vote
ISMIS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A multi-relational clustering method is presented which can be applied to complex knowledge bases storing resources expressed in the standard Semantic Web languages. It a...
156
click to vote
SODA
2001
ACM
15 years 6 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
127
click to vote
WAOA
2007
Springer
15 years 10 months ago
2007
Springer
We continue the study of the online unit clustering problem, introduced by Chan and Zarrabi-Zadeh