DM
2002
15 years 6 hour ago
2002
For every nonnegative integer arc weight function
111
Voted
CORR
2006
Springer
15 years 7 days ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
96
Voted
CORR
2008
Springer
15 years 8 days ago
2008
Springer
We explore the problem of rate and power allocation for a sensor network where pairwise distributed source coding is employed (introduced by Roumy and Gesbert `07). For noiseless n...
105
Voted
OPODIS
2007
15 years 1 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...