3875 search results - page 18 / 775 » Approximation algorithms for the 0-extension problem |
MOR
2000
14 years 9 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
SIAMCO
2002
14 years 9 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
MOC
2000
14 years 9 months ago
2000
The probabilistic approach is used for constructing special layer methods to solve the Cauchy problem for semilinear parabolic equations with small parameter. Despite their probabi...
DAM
1999
14 years 9 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...