Maximizing the minimum voter satisfaction on spanning trees.

Andreas Darmann Christian Klamler Ulrich Pferschy

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

Keyphrases

spanning tree
edge disjoint
minimum cost
minimum spanning tree
minimum spanning trees
minimum total cost
total length
depth first search
user satisfaction
undirected graph
root node
neural network
weighted graph
edge weights