Finding socially best spanning treesî

DOI10.1007/S11238-010-9228-1zbMATH Open1209.91067OpenAlexW2010978589WikidataQ61638314 ScholiaQ61638314MaRDI QIDQ2430005FDOQ2430005

Authors: Andreas Darmann, Christian Klamler, Ulrich Pferschy 

Publication date: 5 April 2011

Published in: Theory and Decision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11238-010-9228-1

Recommendations

• Popular spanning trees
• It is difficult to tell if there is a Condorcet spanning tree
• A note on maximizing the minimum voter satisfaction on spanning trees
• Optimality conditions in preference-based spanning tree problems
• A preference-based approach to spanning trees and shortest paths problems

zbMATH Keywords

social choiceranking spanning treessocially best spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social choice (91B14)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• Voting schemes for which it can be difficult to tell who won the election
• Title not available (Why is that?)
• Sharing a minimal cost spanning tree: beyond the folk solution
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Title not available (Why is that?)
• Basic Geometry of Voting
• Cost monotonicity, consistency and minimum cost spanning tree games
• Characterizations of the plurality function
• Measurement Theory
• Choice under complete uncertainty: Axiomatic characterizations of some decision rules
• Graphs, networks and algorithms.
• Maximizing the minimum voter satisfaction on spanning trees
• A note on maximizing the minimum voter satisfaction on spanning trees
• Maximal-element rationalizability
• Comments on bases in dependence structures
• Arbres minimaux d'un graphe preordonne
• A preference-based approach to spanning trees and shortest paths problems
• Signed orders and power set extensions

Cited In (9)

• Popular branchings and their dual certificates
• A preference-based approach to spanning trees and shortest paths problems
• Committee selection under weight constraints
• Maximizing the minimum voter satisfaction on spanning trees
• It is difficult to tell if there is a Condorcet spanning tree
• A note on maximizing the minimum voter satisfaction on spanning trees
• Popular branchings and their dual certificates
• Popular spanning trees
• The traveling group problem

This page was built for publication: Finding socially best spanning treesî

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