𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The family of cost monotonic and cost additive rules in minimum cost spanning tree problems

✍ Scribed by Gustavo Bergantiños; Leticia Lorenzo; Silvia Lorenzo-Freire


Publisher
Springer
Year
2009
Tongue
English
Weight
203 KB
Volume
34
Category
Article
ISSN
0176-1714

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Models and heuristics for the k -degree
✍ Christophe Duhamel; Luís Gouveia; Pedro Moura; Maurício de Souza 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 1 views

## Abstract The __k__ ‐Degree constrained Minimum Spanning Tree Problem (__k__ ‐DMSTP) consists in finding a minimal cost spanning tree satisfying the condition that every node has a degree no greater than a fixed value __k__. Here we consider an extension where besides the edge costs, a concave co