EFFICIENT DISTRIBUTED ALGORITHMS FOR FINDING CENTERS AND MEDIANS IN NETWORKS (PRELIMINARY VERSION).

E. Korach, D. Rotem, N. Santoro

Research output: Contribution to conferencePaperpeer-review

Abstract

The problem of determining in a distributed fashion the centers and the medians of a network is considered. Lower bounds on the time needed to solve these problems are proved. Algorithms that achieve those bounds for tree networks are presented. The number of exchanged messages is linear in the number of nodes. These techniques are extended to operate on general networks in O(n) times units exchanging O(n multiplied by (times) l) messages, where n is the number of nodes and l is the number of edges in the network. A comparison with a simple heuristic approach is included.

Original languageEnglish
Pages687-696
Number of pages10
StatePublished - 1 Jan 1980
EventProc Annu Allerton Conf Commun Control Comput 18th - Monticello, IL, USA
Duration: 8 Oct 198011 Oct 1980

Conference

ConferenceProc Annu Allerton Conf Commun Control Comput 18th
CityMonticello, IL, USA
Period8/10/8011/10/80

ASJC Scopus subject areas

  • Engineering (all)

Fingerprint

Dive into the research topics of 'EFFICIENT DISTRIBUTED ALGORITHMS FOR FINDING CENTERS AND MEDIANS IN NETWORKS (PRELIMINARY VERSION).'. Together they form a unique fingerprint.

Cite this