Sciweavers

Share
DM
2002
98views more  DM 2002»
8 years 4 months ago
On dijoins
For every nonnegative integer arc weight function
Gérard Cornuéjols, Bertrand Guenin
CORR
2006
Springer
153views Education» more  CORR 2006»
8 years 4 months ago
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
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 ...
Christian Lavault, Mario Valencia-Pabon
CORR
2008
Springer
108views Education» more  CORR 2008»
8 years 4 months ago
Rate and power allocation under the pairwise distributed source coding constraint
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...
Shizheng Li, Aditya Ramamoorthy
OPODIS
2007
8 years 5 months ago
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
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 ...
Sven Oliver Krumke, Peter Merz, Tim Nonner, Kathar...
books