2714 search results - page 22 / 543 » Approximation Schemes for Scheduling |
EOR
2002
15 years 5 days ago
2002
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
98
Voted
AAMAS
2002
Springer
15 years 7 days ago
2002
Springer
There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support eff...
106
Voted
APPROX
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
112
click to vote
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
127
Voted
DISOPT
2010
15 years 14 days ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...