16 search results - page 1 / 4 » A Sublinear-Time Randomized Approximation Scheme for the Rob... |
155
click to vote
RECOMB
2006
Springer
16 years 6 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
146
Voted
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
136
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...
186
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
139
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...