𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximating the Maximum Internal Spanning Tree problem

✍ Scribed by Gábor Salamon

Book ID
108281582
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
933 KB
Volume
410
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the approximability of some maximum s
On the approximability of some maximum spanning tree problems
✍ Giulia Galbiati; Angelo Morzenti; Francesco Maffioli 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 844 KB

We study the approximability of some problems which aim at finding spanning trees in undirected graphs which maximize, rather than minimize, a single objective function representing a form of benefit or usefulness of the tree. We prove that the problem of finding a spanning tree which maximizes the

The maximum f-depth spanning tree proble
The maximum f-depth spanning tree problem
✍ Jérôme Monnot 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 113 KB

This paper deals with the problem of constructing directed trees of optimal weight and root r with depth at most f (|V |) (called f -depthDSTP r ). We first prove that the maximization and the minimization versions are equal-approximable under the differential ratio, that measures how the value of a