496 search results - page 14 / 100 » A Polynomial-Time Approximation Algorithm for a Geometric Di... |
STOC
2002
ACM
14 years 8 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
Models of forest ecosystems are needed to understand how climate and land-use change can impact biodiversity. In this paper we describe an individual-based, spatially-explicit for...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
DCOSS
2009
Springer
14 years 2 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
ICALP
2000
Springer
13 years 11 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...