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

DOI10.1016/J.DAM.2011.04.017MaRDI QIDQ2275934zbMATH OpenOpenAlexFDO

Authors G. 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

Boruvka's algorithmfolk solutionminimum cost spanning tree

Mathematics Subject Classification ID

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

Recommendations

• \textit{Folk} solution for simple minimum cost spanning tree problems
• Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
• Sharing a minimal cost spanning tree: beyond the folk solution
• The folk rule for minimum cost spanning tree problems with multiple sources
• A fair rule in minimum cost spanning tree problems

Cites work

• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
• A fair rule in minimum cost spanning tree problems
• A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations
• Additivity in minimum cost spanning tree problems
• Cost monotonicity, consistency and minimum cost spanning tree games
• scientific article; zbMATH DE number 1424297 (Why is no real title available?)
• Locality behavior of parallel and sequential algorithms for irregular graph problems
• On cost allocation for a spanning tree: A game theoretic approach
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The P-value for cost sharing in minimum
• The optimistic TU game in minimum cost spanning tree problems

Cited in

(7)

• The degree and cost adjusted folk solution for minimum cost spanning tree games
• \textit{Folk} solution for simple minimum cost spanning tree problems
• The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
• THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context
• Merge-proofness in minimum cost spanning tree problems
• Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
• A non-cooperative approach to the folk rule in minimum cost spanning tree problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275934)