Distributed Selection: A Missing Piece of Data Aggregation.

In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each node holds a numeric element, the goal of a k-selection algorithm is to determine the kth smallest of these elements. We...

Full description

Bibliographic Details
Published in:Communications of the ACM Vol. 51; no. 9; pp. 93 - 100
Main Authors: Kuhn, Fabian, Locher, Thomas, Wattenhofer, Roger
Format: Article
Published: Association for Computing Machinery Sep2008
Subjects:
Online Access:View this record in EBSCOhost