5595 search results - page 211 / 1119 » Approximation Algorithms for Clustering Problems |
164
click to vote
JPDC
2007
15 years 6 months ago
2007
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
162
click to vote
WABI
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
145
click to vote
HPCC
2007
Springer
16 years 13 days ago
2007
Springer
In mobile-AdHoc networks (MANETs), many applications need the support of layer-structure. Clustering solution is the most widely used layerstructure and the choosing of clusterhead...
147
click to vote
WADS
2007
Springer
16 years 12 days ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
302
click to vote
WADS
2009
Springer
16 years 27 days ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...