SODA
2001
ACM
13 years 11 months ago
2001
ACM
SODA
2001
ACM
13 years 11 months ago
2001
ACM
This paper describes an algorithm for maintaining an approximating triangulation of a deforming surface in
SODA
2001
ACM
13 years 11 months ago
2001
ACM
d Abstract) Moses Charikar Samir Khullery David M. Mountz Giri Narasimhanx Facility location problems are traditionally investigated with the assumption that all the clients are t...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
SODA
2001
ACM
13 years 11 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
SODA
2001
ACM
13 years 11 months ago
2001
ACM
SODA
2001
ACM
13 years 11 months ago
2001
ACM
We compute the regression depth of a k-flat in a set of n points in Rd, in time O(nd-2 + n log n) for 1 k d - 2. This contrasts with a bound of O(nd-1 + n log n) when k = 0 or
SODA
2001
ACM
13 years 11 months ago
2001
ACM
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly eff...