4894 search results - page 352 / 979 » The Guarding Problem - Complexity and Approximation |
174
click to vote
WAOA
2005
Springer
16 years 6 days ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
204
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
190
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
188
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
160
click to vote
CIARP
2009
Springer
16 years 1 months ago
2009
Springer
This paper brings a contribution to the problem of efficiently recognizing handwritten words from a limited size lexicon. For that, a multiple classifier system has been developed...