3192 search results - page 199 / 639 » The minimum latency problem |
150
click to vote
TAMC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
160
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We consider the problem of minimum distortion intrinsic correspondence between deformable shapes, many useful formulations of which give rise to the NP-hard quadratic assignment p...
150
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
154
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
124
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— In this paper, we formalize the problem of barrier coverage, that is, the problem of preventing undetected intrusion in a particular region using robot sensors. We solv...