5595 search results - page 226 / 1119 » Approximation Algorithms for Clustering Problems |
169
click to vote
STOC
2005
ACM
15 years 12 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
175
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
168
click to vote
CCE
2004
15 years 6 months ago
2004
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
186
Voted
ALGORITHMICA
2010
15 years 6 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
188
click to vote
ICDAR
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper introduces a framework for clarifying and formalizing the duplicate document detection problem. Four distinct models are presented, each with a corresponding algorithm ...