๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Tree Approximation and Optimal Encoding

โœ Scribed by Albert Cohen; Wolfgang Dahmen; Ingrid Daubechies; Ronald DeVore

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
366 KB
Volume
11
Category
Article
ISSN
1063-5203

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximating the Minimum-Degree Steiner
Approximating the Minimum-Degree Steiner Tree to within One of Optimal
โœ M. Furer; B. Raghavachari ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 691 KB

The problem of constructing a spanning tree for a graph \(G=(V, E)\) with \(n\) vertices whose maximal degree is the smallest among all spanning trees of \(G\) is considered. This problem is easily shown to be NP-hard. In the Steiner version of this problem, along with the input graph, a set of dist

A Polynomial Time Approximation Scheme f
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
โœ Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 155 KB

Given an undirected graph with nonnegative edge lengths and nonnegative vertex weights, the routing requirement of a pair of vertices is assumed to be the product of their weights. The routing cost for a pair of vertices on a given spanning tree is defined as the length of the path between them mult

Best approximation and optimization
Best approximation and optimization
โœ Ivan Singer ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 635 KB