Sciweavers

19 search results - page 1 / 4
» On the Probabilistic min spanning tree problem
Sort
View
IMCSIT
2010
13 years 2 days ago
On the Probabilistic min spanning tree problem
Nicolas Boria, Cécile Murat, Vangelis Th. P...
WINET
2010
128views more  WINET 2010»
13 years 3 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...
FSTTCS
2007
Springer
13 years 11 months ago
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b  2. The aim is to nd a minimum weight spannin...
Anand Srivastav, Sören Werth
COCOON
2006
Springer
13 years 9 months ago
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 5 months ago
On Byzantine Containment Properties of the $min+1$ Protocol
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...