3874 search results - page 139 / 775 » Approximation Algorithms for k-hurdle Problems |
121
click to vote
STOC
1996
ACM
15 years 5 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...
120
click to vote
CCE
2004
15 years 1 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...
134
click to vote
ALGORITHMICA
2010
15 years 1 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...
137
click to vote
ICDAR
1999
IEEE
15 years 6 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 ...
104
click to vote
SIAMCOMP
2010
14 years 8 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...