We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...