✦ LIBER ✦

An improved algorithm for finding the median distributively

✍ Scribed by Francis Chin; H. F. Ting

Book ID: 105325616
Publisher: Springer
Year: 1987
Tongue: English
Weight: 688 KB
Volume: 2
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01840361

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On “an improved algorithm for finding th

On “an improved algorithm for finding the median distributively” [1]

✍ S. L. Mantzaris 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 172 KB

Finding the median distributively

✍ Michael Rodeh 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 309 KB

An algorithm finding p-medians of a grap

An algorithm finding p-medians of a graph

✍ S. A. Gorunovich 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 455 KB

An Algorithm for Finding the Causal Dist

An Algorithm for Finding the Causal Distributed Breakpoint

✍ Toshimitsu Masuzawa; Nobuki Tokura 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 137 KB

An improved algorithm for the minmax reg

An improved algorithm for the minmax regret median problem on a tree

✍ Igor Averbakh; Oded Berman 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB 👁 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a “minmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because

An algorithm for finding the distributio

An algorithm for finding the distribution of maximal entropy

✍ N Agmon; Y Alhassid; R.D Levine 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 531 KB