SODA
2001
ACM
13 years 5 months ago
2001
ACM
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
SODA
2001
ACM
13 years 5 months ago
2001
ACM
SODA
2001
ACM
13 years 5 months ago
2001
ACM
We present an algorithm which provably reconstructs a collection of curves with corners and endpoints from a sample set that satisfies a certain sampling condition. The algorithm ...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
SODA
2001
ACM
13 years 5 months ago
2001
ACM
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
SODA
2001
ACM
13 years 5 months ago
2001
ACM
We consider rule sets for internet packet routing and filtering, where each rule consists of a range of source addresses, a range of destination addresses, a priority, and an acti...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...