107 search results - page 11 / 22 » Approximation algorithms for art gallery problems in polygon... |
IAT
2009
IEEE
15 years 6 months ago
2009
IEEE
We address the problem of multi-UAV surveillance in complex urban environments with occlusions. The problem consists of coordinating the flight of UAVs with on-board cameras so t...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
JC
2006
14 years 11 months ago
2006
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
122
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
DAGSTUHL
2004
15 years 1 months ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...