✦ 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
DOI: 10.1007/s00355-009-0426-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The optimisticTUgame in minimum cost spa

The optimisticTUgame in minimum cost spanning tree problems

✍ Gustavo Bergantiños; Juan J. Vidal-Puga 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 248 KB

A characterization of Kruskal sharing ru

A characterization of Kruskal sharing rules for minimum cost spanning tree problems

✍ Leticia Lorenzo; Silvia Lorenzo-Freire 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 296 KB

A characterization of optimistic weighte

A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems

✍ Gustavo Bergantiños; Silvia Lorenzo-Freire 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 216 KB

Models and heuristics for the k -degree

Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs

✍ 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