The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
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.
KeywordsCost Matrix Sharing Function Axiomatic Characterization Minimum Cost Span Tree Path Independence
Unable to display preview. Download preview PDF.
- Bergantiños G, Kar A (2007) Monotonicity properties and the irreducible core in minimum cost spanning tree problems. University of Vigo, MimeoGoogle Scholar
- Feltkamp V, Tijs S, Muto S (1994) On the irreducible core and the equal remaining obligation rule of minimum cost extension problems. Tilburg University, MimeoGoogle Scholar