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

Gustavo Bergantiños Cid , Leticia Lorenzo Picado , Silvia Lorenzo Freire

• In this paper we define a new family of rules in minimum cost spanning tree problems related with Kruskal�s algorithm. We characterize this family with a cost monotonicity property and a cost additivity property. Adding the property of core selection (or separability) to the previous characterization, we obtain the family of obligation rules defined in Tijs et al (2006).

  Keywords: minimum cost spanning tree problems, cost monotonicity, cost additivity.