1760 search results - page 53 / 352 » Connected Set Cover Problem and Its Applications |
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
NETGAMES
2003
ACM
14 years 2 months ago
2003
ACM
Plenty of work was contributed in the field of protocol design and performance evaluation of multi-hop networks. It is generally accepted that mobility has a huge impact on the p...
COMMA
2008
13 years 10 months ago
2008
Abstract. We present a variant of AB-dispute derivations for assumption-based argumentation (ABA), that can be used for determining the admissibility of claims. ABA reduces the pro...
SIAMCOMP
1998
13 years 8 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...