455 search results - page 71 / 91 » Approximation Algorithms for Partial Covering Problems |
SIAMCOMP
1998
14 years 9 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
108
click to vote
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— In the real world, noisy sensors and limited communication make it difficult for robot teams to coordinate in tightly coupled tasks. Team members cannot simply apply single-ro...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
CONSTRAINTS
2007
14 years 9 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...