1046 search results - page 33 / 210 » Approximation Algorithms for Domination Search |
RTA
2010
Springer
13 years 10 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
CAINE
2001
13 years 10 months ago
2001
In this paper, a new method for the approximation of discrete time state-affine systems is proposed. The method is based on the diagonalization of proposed generalized controllabi...
DAM
2011
13 years 3 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
3DIM
2003
IEEE
14 years 4 days ago
2003
IEEE
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...