𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the approximation ability of evolutionary optimization with application to minimum set cover

✍ Scribed by Yang Yu; Xin Yao; Zhi-Hua Zhou

Book ID
113469355
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
278 KB
Volume
180-181
Category
Article
ISSN
0004-3702

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