๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems

โœ Scribed by Christian Trudeau


Book ID
120785826
Publisher
Springer
Year
2013
Tongue
English
Weight
307 KB
Volume
42
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