Sciweavers

13987 search results - page 305 / 2798
» The Two Guards Problem
Sort
View
KGC
1997
Springer
15 years 11 months ago
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization
The tree isomorphism problem is the problem of determining whether two trees are isomorphic. The tree canonization problem is the problem of producing a canonical tree isomorphic t...
Samuel R. Buss
SODA
2000
ACM
125views Algorithms» more  SODA 2000»
15 years 8 months ago
Approximation algorithms for projective clustering
We consider the following two instances of the projective clustering problem: Given a set
Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
CORR
2007
Springer
84views Education» more  CORR 2007»
15 years 6 months ago
Linear versus Non-linear Acquisition of Step-Functions
We address in this paper the following two closely related problems:
Boris Ettinger, Niv Sarig, Yosef Yomdin
CCCG
2010
15 years 8 months ago
Constrained k-center and movement to independence
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
Adrian Dumitrescu, Minghui Jiang
DAGSTUHL
2007
15 years 8 months ago
Graph matching with type constraints on nodes and edges
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
Catherine Fraikin, Paul Van Dooren