A note on maximizing the minimum voter satisfaction on spanning trees.

Andreas Darmann Christian Klamler Ulrich Pferschy

Published in: Math. Soc. Sci. (2010)

Keyphrases

spanning tree
edge disjoint
minimum cost
minimum spanning tree
minimum spanning trees
total length
depth first search
minimum total cost
edge weights
root node
customer satisfaction
lowest cost
information systems
undirected graph
user satisfaction
approximation algorithms
multi agent