𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for minimumk-covers in weighted graphs

✍ Scribed by Lee J. White; Mark L. Gillenson

Publisher
Springer-Verlag
Year
1975
Tongue
English
Weight
945 KB
Volume
8
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Efficient Algorithm for Minimum-Weigh
An Efficient Algorithm for Minimum-Weight Bibranching
✍ J. Keijsper; R. Pendavingh πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 280 KB

Given a directed graph D=(V, A) and a set S V, a bibranching is a set of arcs B A that contains a v&(V "S) path for every v # S and an S&v path for every v # V "S. In this paper, we describe a primal dual algorithm that determines a minimum weight bibranching in a weighted digraph. It has running ti