17 search results - page 3 / 4 » Approximating min-max k-clustering |
ORL
1998
14 years 11 months ago
1998
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
102
click to vote
STACS
2007
Springer
15 years 5 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
EDBT
2009
ACM
15 years 3 months ago
2009
ACM
The concept of time-constrained SQL queries was introduced to address the problem of long-running SQL queries. A key approach adopted for supporting time-constrained SQL queries i...
EMSOFT
2004
Springer
15 years 4 months ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
79
Voted
DAGSTUHL
2007
15 years 22 days ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...