𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Game tree searching by min/max approximation

✍ Scribed by Ronald L. Rivest

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
931 KB
Volume
34
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation Algorithms for Min–Max Tre
Approximation Algorithms for Min–Max Tree Partition
✍ Nili Guttmann-Beck; Refael Hassin πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 298 KB

We consider the problem of partitioning the node set of a graph into p equal sized subsets. The objective is to minimize the maximum length, over these subsets, of a minimum spanning tree. We show that no polynomial algorithm with bounded Ε½ 2 . error ratio can be given for the problem unless P s NP.

Approximation hardness of min–max tree c
Approximation hardness of min–max tree covers
✍ Zhou Xu; Qi Wen πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 367 KB

We prove the first inapproximability bounds to study approximation hardness for a min-max k-tree cover problem and its variants. The problem is to find a set of k trees to cover vertices of a given graph with metric edge weights, so as to minimize the maximum total edge weight of any of the k trees.