STOC
2002
ACM
14 years 5 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
STOC
2002
ACM
14 years 5 months ago
2002
ACM
In the dynamic load balancing problem, we seek to keep the job load roughly evenly distributed among the processors of a given network. The arrival and departure of jobs is modeled...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
STOC
2002
ACM
14 years 5 months ago
2002
ACM
STOC
2002
ACM
14 years 5 months ago
2002
ACM
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
STOC
2002
ACM
14 years 5 months ago
2002
ACM
STOC
2002
ACM
14 years 5 months ago
2002
ACM
STOC
2002
ACM
14 years 5 months ago
2002
ACM
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...