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

E. Korach; D. Rotem; N. Santoro

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

E. Korach, D. Rotem, N. Santoro

Department of Industrial Engineering and Management

Research output: Contribution to conference › Paper › peer-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 language	English
Pages	687-696
Number of pages	10
State	Published - 1 Jan 1980
Event	Proc Annu Allerton Conf Commun Control Comput 18th - Monticello, IL, USA Duration: 8 Oct 1980 → 11 Oct 1980

Conference

Conference	Proc Annu Allerton Conf Commun Control Comput 18th
City	Monticello, IL, USA
Period	8/10/80 → 11/10/80

ASJC Scopus subject areas

General Engineering

Cite this

@conference{e02b6394194443fab73373a2de7e1dd0,

title = "EFFICIENT DISTRIBUTED ALGORITHMS FOR FINDING CENTERS AND MEDIANS IN NETWORKS (PRELIMINARY VERSION).",

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.",

author = "E. Korach and D. Rotem and N. Santoro",

year = "1980",

month = jan,

day = "1",

language = "English",

pages = "687--696",

note = "Proc Annu Allerton Conf Commun Control Comput 18th ; Conference date: 08-10-1980 Through 11-10-1980",

}

TY - CONF

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

AU - Korach, E.

AU - Rotem, D.

AU - Santoro, N.

PY - 1980/1/1

Y1 - 1980/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85095463823&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:85095463823

SP - 687

EP - 696

T2 - Proc Annu Allerton Conf Commun Control Comput 18th

Y2 - 8 October 1980 through 11 October 1980

ER -

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

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this