107 search results - page 14 / 22 » Approximation algorithms for art gallery problems in polygon... |
IPSN
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
CSCLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectorie...