✦ LIBER ✦

An O(nm) algorithm for a special case of the multimedian location problem on a tree

✍ Scribed by Dilip Chhajed; Timothy J. Lowe

Book ID: 107992255
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 556 KB
Volume: 63
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(92)90027-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An average case analysis of a greedy alg

An average case analysis of a greedy algorithm for the on-line Steiner tree problem

✍ Ying Teh Tsai; Chuan Yi Tang; Yunn Yen Chen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 719 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 $O ( ( n\log p )^2 )$ Algorithm for t

An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p -Center Problem on a Tree

✍ Chandrasekaran, R.; Tamir, A. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics ⚖ 776 KB

An algorithm for the solution of a locat

An algorithm for the solution of a location problem with metric constraints

✍ Margaret K. Schaefer; Arthur P. Hurter Jr. 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 608 KB

An O(n2) Algorithm for the Characteristi

An O(n2) Algorithm for the Characteristic Polynomial of a Tree

✍ David P. Jacobs; Catia M.S. Machado; Vilmar Trevisan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 355 KB

An algorithm for a special case of a gen

An algorithm for a special case of a generalization of the Richardson extrapolation process

✍ Avram Sidi 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 393 KB