6 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.DS2017★ 6 cited
Balanced power diagrams for redistricting
Vincent Cohen-Addad, Philip N. Klein, Neal E. Young
We propose a method for redistricting, decomposing a geographical area into subareas, called districts, so that the populations of the districts are as close as possible and the di…
cs.DS2013
Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons
Neal E. Young
We give a short proof that any comparison-based n^(1-epsilon)-approximation algorithm for the 1-dimensional Traveling Salesman Problem (TSP) requires Omega(n log n) comparisons.
cs.DS2012★ 1 cited
Caching with rental cost and zapping
Monik Khare, Neal E. Young
The \emph{file caching} problem is defined as follows. Given a cache of size (a positive integer), the goal is to minimize the total retrieval cost for the given sequence of re…