In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
The Perspective-N-Point problem (PNP) is a notable problem in computer vision. It consists in, given N points known in an object coordinate space and their projection onto the ima...
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...