𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch and cut algorithm for minimum spanning trees under conflict constraints

✍ Scribed by Samer, Phillippe; Urrutia, Sebastián


Book ID
125372925
Publisher
Springer-Verlag
Year
2014
Tongue
English
Weight
272 KB
Volume
9
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A distributed algorithm for constructing
✍ Thilmee M. Baduge; Akihito Hiromori; Hirozumi Yamaguchi; Teruo Higashino 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 787 KB

## Abstract In this paper, we propose a new protocol that constructs a spanning tree on an overlay network given by a complete graph, in a decentralized manner. This algorithm consists of two decentralized operations, which support joining of and leaving of the overlay network at any time in the se