7133 search results - page 309 / 1427 » Communication algorithms with advice |
200
click to vote
JSAC
2008
15 years 6 months ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
172
click to vote
TELSYS
2008
15 years 6 months ago
2008
Increase in the network usage for more and more performance critical applications has caused a demand for tools that can monitor network health with minimum management traffic. Ada...
221
click to vote
JUCS
2007
15 years 6 months ago
2007
: Clustering provides an effective mechanism for energy-efficient data delivery in wireless sensor networks. To reduce communication cost, most clustering algorithms rely on a sens...
197
click to vote
JGAA
2000
15 years 6 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
216
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...