8 citations · 24 across the 27 of their papers we have counts for
Showing 2013 · cs.GTShow all
2 papers · 2 filters
cs.GT2013
Optimal Impartial Selection
Felix Fischer, Max Klimm
We study the problem of selecting a member of a set of agents based on impartial nominations by agents from that set. The problem was studied previously by Alon et al. and Holzman…
cs.GT2013
Complexity and Approximation of the Continuous Network Design Problem
Martin Gairing, Tobias Harks, Max Klimm
We revisit a classical problem in transportation, known as the continuous (bilevel) network design problem, CNDP for short. We are given a graph for which the latency of each edge…