𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improved algorithm of kinetic tree theory

✍ Scribed by Liu Jingcheng; Pan Zhijie

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
296 KB
Volume
23
Category
Article
ISSN
0951-8320

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Kinetic heap-ordered trees: Tight analys
Kinetic heap-ordered trees: Tight analysis and improved algorithms
✍ Guilherme D. da Fonseca; Celina M.H. de Figueiredo πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 99 KB

The most natural kinetic data structure for maintaining the maximum of a collection of continuously changing numbers is the kinetic heap. Basch, Guibas, and Ramkumar proved that the maximum number of events processed by a kinetic heap with n numbers changing as linear functions of time is O(n log 2

Euclidean Steiner minimum trees: An impr
Euclidean Steiner minimum trees: An improved exact algorithm
✍ Winter, Pawel; Zachariasen, Martin πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 296 KB

The Euclidean Steiner tree problem asks for a shortest network interconnecting a set of terminals in the plane. Over the last decade, the maximum problem size solvable within 1 h (for randomly generated problem instances) has increased from 10 to approximately 50 terminals. We present a new exact al

An Improved Algorithm for Statistical Al
An Improved Algorithm for Statistical Alignment of Sequences Related by a Star Tree
✍ IstvΓ‘n MiklΓ³s πŸ“‚ Article πŸ“… 2002 πŸ› Springer 🌐 English βš– 102 KB

The insertion-deletion model developed by Thorne, Kishino and Felsenstein (1991, J. Mol. Evol., 33, 114-124; the TKF91 model) provides a statistical framework of two sequences. The statistical alignment of a set of sequences related by a star tree is a generalization of this model. The known algorit

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