306 search results - page 16 / 62 » Parallel approximation algorithms for facility-location prob... |
146
Voted
ICCS
2009
Springer
16 years 27 days ago
2009
Springer
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
176
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
163
click to vote
COMPGEOM
2006
ACM
16 years 9 days ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
170
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
161
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...