Sciweavers

36 search results - page 5 / 8
» Distributed algorithms for covering, packing and maximum wei...
Sort
View
SPAA
2005
ACM
14 years 1 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
CCR
2004
110views more  CCR 2004»
13 years 7 months ago
Distributed scheduling policies in networks of input-queued packet switches
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability ...
Claus Bauer
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
14 years 1 months ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
André Berger, Ojas Parekh
PDCAT
2005
Springer
14 years 1 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
MOBICOM
2009
ACM
14 years 2 months ago
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distribute...
Gaurav S. Kasbekar, Yigal Bejerano, Saswati Sarkar