SODA
2004
ACM
13 years 11 months ago
2004
ACM
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
SODA
2004
ACM
13 years 11 months ago
2004
ACM
SODA
2004
ACM
13 years 11 months ago
2004
ACM
Simulated tempering and swapping are two families of sampling algorithms in which a parameter representing temperature varies during the simulation. The hope is that this will ove...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
SODA
2004
ACM
13 years 11 months ago
2004
ACM
Delaunay tessellations and Voronoi diagrams capture proximity relationships among sets of points in any dimension. When point coordinates are not known exactly, as in the case of ...