401 search results - page 17 / 81 » Algorithms for a Simple Point Placement Problem |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
ICCTA
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Bose et al. [2] asked whether for every simple arrangement A of n lines in the plane there exists a simple n-gon P that induces A by extending every edge of P into a line. We prov...
EMSOFT
2007
Springer
14 years 1 months ago
2007
Springer
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...