✦ LIBER ✦

An optimal bound for path weights in Huffman trees

✍ Scribed by Peter Kirrinnis

Book ID: 103103955
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 536 KB
Volume: 51
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00069-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm for finding an o

A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree

✍ K. Viswanathan Iyer; S. Prasanna 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 132 KB

Searching for an optimal path in a tree

Searching for an optimal path in a tree with random costs

✍ Richard M. Karp; Judea Pearl 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 690 KB

An optimal algorithm for the maximum-den

An optimal algorithm for the maximum-density path in a tree

✍ Bang Ye Wu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Optimal Algorithms for the Path/Tree-Sha

Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees

✍ Binay Bhattacharya; Qiaosheng Shi; Arie Tamir 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 502 KB

Efficient Parallel Algorithms for Optima

Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network

✍ Biing-Feng Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce

An Optimal Algorithm for Broadcasting Mu

An Optimal Algorithm for Broadcasting Multiple Messages in Trees

✍ Krzysztof Diks; Andrzej Lingas; Andrzej Pelc 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 118 KB

We consider multiple message broadcasting in tree networks. The source (considered as the root of the tree) has k messages which have to be broadcast to all nodes of the tree. In every time unit each node can send one of its already obtained messages to one of its children. A k-message broadcasting