We design new algorithms for k-clustering in high-dimensional Euclidean
...
In Euclidean Uniform Facility Location, the input is a set of clients in...
In the Shortest Superstring problem, we are given a set of strings and w...
Estimating the distribution and quantiles of data is a foundational task...
We consider the problem of managing the buffer of a shared-memory switch...
We consider a natural generalization of the Steiner tree problem, the St...
Approximating ranks, quantiles, and distributions over streaming data is...
Problems involving the efficient arrangement of simple objects, as captu...
Quantiles, such as the median or percentiles, provide concise and useful...
In the online packet scheduling problem with deadlines (PacketScheduling...
We study the Steiner Tree problem, in which a set of terminal vertices n...