The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
UNIVERSAL IDENTIFIER: http://hdl.handle.net/11093/1101
EDITED VERSION: http://link.springer.com/10.1007/s00355-009-0426-0
UNESCO SUBJECT: 5399 Otras Especialidades económicas
DOCUMENT TYPE: article
In this article, 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.
Files in this item