182 citations · 549 across the 43 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012
Search for the end of a path in the d-dimensional grid and in other graphs
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi +2
We consider the worst-case query complexity of some variants of certain \cl{PPAD}-complete search problems. Suppose we are given a graph and a vertex . We denote th…
math.MG2012★ 12 cited
Optimally solving a transportation problem using Voronoi diagrams
Darius Geiß, Rolf Klein, Rainer Penninger +1
We consider the following variant of the Monge-Kantorovich transportation problem. Let S be a finite set of point sites in d dimensions. A bounded set C in d-dimensional space is t…