5595 search results - page 92 / 1119 » Approximation Algorithms for Clustering Problems |
123
click to vote
STOC
1995
ACM
15 years 8 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
142
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
161
click to vote
STOC
1998
ACM
15 years 9 months ago
1998
ACM
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
134
click to vote
DASFAA
2008
IEEE
15 years 11 months ago
2008
IEEE
Clustering time series is usually limited by the fact that the length of the time series has a significantly negative influence on the runtime. On the other hand, approximative c...
254
click to vote
CP
2009
Springer
16 years 5 months ago
2009
Springer
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...