The folk solution and Boruvka's algorithm in minimum cost spanning tree problems

DOI10.1016/J.DAM.2011.04.017zbMath1218.90049OpenAlexW2120031519MaRDI QIDQ2275934

Gustavo Bergantiños, Juan J. Vidal-Puga

Publication date: 10 August 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://mpra.ub.uni-muenchen.de/17839/1/MPRA_paper_17839.pdf

zbMATH Keywords

folk solutionminimum cost spanning treeBoruvka's algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)

Related Items (3)

Algorithms for computing the folk rule in minimum cost spanning tree problems with groups ⋮ The degree and cost adjusted folk solution for minimum cost spanning tree games ⋮ Merge-proofness in minimum cost spanning tree problems

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Cost monotonicity, consistency and minimum cost spanning tree games
• A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations
• Additivity in minimum cost spanning tree problems
• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
• The optimistic \(TU\) game in minimum cost spanning tree problems
• A fair rule in minimum cost spanning tree problems
• The \(P\)-value for cost sharing in minimum
• On cost allocation for a spanning tree: A game theoretic approach
• Unnamed Item
• Unnamed Item

This page was built for publication: The folk solution and Boruvka's algorithm in minimum cost spanning tree problems