SODA
2003
ACM
13 years 6 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
SODA
2003
ACM
13 years 6 months ago
2003
ACM
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
d Abstract) N. Alon ∗ M. Capalbo † July 28, 2002 Using a new recursive technique, we present an explicit construction of an infinite family of N-superconcentrators of density...