1298 search results - page 121 / 260 » The online set cover problem |
170
click to vote
CIAC
2010
Springer
16 years 3 months ago
2010
Springer
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
160
click to vote
CJ
2008
15 years 6 months ago
2008
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated convergence theorems that show they tend to give good proba...
207
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
185
click to vote
SPW
2000
Springer
15 years 10 months ago
2000
Springer
In the context of the security of wireless ad hoc networks, we previously explored the problem of secure transient association between a master and a slave device in the absence of...
140
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract— We consider the problem of multi-robot coordination subject to constraints on the configuration. Specifically, we examine the case in which a mobile network of robots...