Sciweavers

3192 search results - page 95 / 639
» The minimum latency problem
Sort
View
105
Voted
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
14 years 8 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
84
Voted
COCOON
2009
Springer
15 years 4 months ago
On Finding Small 2-Generating Sets
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) s.t. every element...
Isabelle Fagnot, Guillaume Fertin, Stéphane...
82
Voted
CORR
2008
Springer
108views Education» more  CORR 2008»
14 years 10 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
92
Voted
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 10 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
INFOCOM
2006
IEEE
15 years 4 months ago
Minimum User-Perceived Interference Routing in Service Composition
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
Li Xiao, Klara Nahrstedt