Sharing the cost of maximum quality optimal spanning trees

DOI10.1007/s11750-020-00568-9zbMath1471.90048OpenAlexW2973150027MaRDI QIDQ1979176

Begoña Subiza, Josep E. Peris

Publication date: 2 September 2021

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://web.ua.es/es/dmcte/documentos/qmetwp1902.pdf

zbMATH Keywords

qualitycost sharingmulti-objective decision makingminimum cost spanning tree

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Communication networks in operations research (90B18) Management decision making, including multiple objectives (90B50)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Fast dynamic transitive closure with lookahead
• Sharing a minimal cost spanning tree: beyond the folk solution
• An improved algorithm for transitive closure on acyclic digraphs
• A fair rule in minimum cost spanning tree problems
• CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS
• On the core and nucleolus of minimum cost spanning tree games
• On cost allocation for a spanning tree: A game theoretic approach

This page was built for publication: Sharing the cost of maximum quality optimal spanning trees