331 search results - page 37 / 67 » Approximation Algorithms for Connected Dominating Sets |
IROS
2006
IEEE
15 years 5 months ago
2006
IEEE
— In appearance based robot localization a new image is matched with every image in the database. In this paper we describe how to reduce the number of images in this database wi...
109
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in an...
DISOPT
2008
14 years 12 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
TALG
2010
14 years 10 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
126
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...