214 search results - page 20 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
77
Voted
TAMC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
82
Voted
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
75
Voted
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
97
Voted
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
ICAS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Traditionally, performance has been the most important metrics when evaluating a system. However, in the last decades industry and academia have been paying increasing a...