5595 search results - page 129 / 1119 » Approximation Algorithms for Clustering Problems |
239
click to vote
ICDE
2003
IEEE
16 years 6 months ago
2003
IEEE
Clustering of large data bases is an important research area with a large variety of applications in the data base context. Missing in most of the research efforts are means for g...
123
click to vote
IJCGA
2002
15 years 4 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
146
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
115
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
141
Voted
TOC
2008
15 years 4 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...