306 search results - page 15 / 62 » Parallel approximation algorithms for facility-location prob... |
SODA
2012
ACM
12 years 12 months ago
2012
ACM
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
67
Voted
STOC
1999
ACM
15 years 1 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
SIAMCOMP
2010
14 years 4 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
88
Voted
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...