SODA
2008
ACM
13 years 11 months ago
2008
ACM
SODA
2008
ACM
13 years 11 months ago
2008
ACM
We present a method to maintain a mesh approximating a deforming surface, which is specified by a dense set of sample points. We identify a reasonable motion model for which a pro...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
SODA
2008
ACM
13 years 11 months ago
2008
ACM
A Steiner star for a set P of n points in Rd connects an arbitrary point in Rd to all points of P, while a star connects one of the points in P to the remaining n - 1 points of P....
SODA
2008
ACM
13 years 11 months ago
2008
ACM
SODA
2008
ACM
13 years 11 months ago
2008
ACM
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical theorems of Bourgain, and of Johnson and Lindenstrauss say that any metric on n p...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
SODA
2008
ACM
13 years 11 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...