— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
Glencora Borradaile, Philip N. Klein, Claire Mathi...
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
The result of simulation of an idealized thin wet film connecting fixed points in the Euclidean plane is a length-minimizing curve. Gradually increasing the exterior pressure we ar...