This paper combines social choice theory with discrete optimization. We assume that individuals have preferences over edges of a graph that need to be aggregated. The goal is to find a socially "best" spanning tree in the graph. As ranking all spanning trees is becoming infeasible even for small...