1161 search results - page 16 / 233 » Approximation schemes for clustering problems |
120
click to vote
CORR
2010
Springer
14 years 12 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,
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
109
click to vote
DAM
2006
14 years 11 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...