𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Gilbert arborescence problem

✍ Scribed by M. G. Volz; M. Brazil; C. J. Ras; K. J. Swanepoel; D. A. Thomas

Book ID
112163206
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
159 KB
Volume
61
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The rectilinear steiner arborescence pro
The rectilinear steiner arborescence problem
✍ Sailesh K. Rao; P. Sadayappan; Frank K. Hwang; Peter W. Shor πŸ“‚ Article πŸ“… 1992 πŸ› Springer 🌐 English βš– 627 KB
Minimum-weight rooted not-necessarily-sp
Minimum-weight rooted not-necessarily-spanning arborescence problem
✍ V. Venkata Rao; R. Sridharan πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 687 KB

## Abstract In this paper, we propose the problem of identifying a minimum‐weight rooted not‐necessarily‐spanning arborescence (MRA) in a directed rooted acyclic graph with weights on arcs. We show this problem to be NP‐hard and formulate it as a zeroβ€”one integer program. We develop a heuristic __H

Models and heuristics for a minimum arbo
Models and heuristics for a minimum arborescence problem
✍ Christophe Duhamel; Luis Gouveia; Pedro Moura; Mauricio Souza πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 194 KB

## Abstract The Minimum Arborescence problem (MAP) consists of finding a minimum cost arborescence in a directed graph. This problem is NP‐Hard and is a generalization of two well‐known problems: the Minimum Spanning Arborescence Problem (MSAP) and the Directed Node Weighted Steiner Tree Problem (D