Sciweavers

RANDOM
1999
Springer
13 years 9 months ago
Approximation of Multi-color Discrepancy
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
Benjamin Doerr, Anand Srivastav
RANDOM
1999
Springer
13 years 9 months ago
Fast Approximate PCPs for Multidimensional Bin-Packing Problems
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
Tugkan Batu, Ronitt Rubinfeld, Patrick White
RANDOM
1999
Springer
13 years 9 months ago
Linear Consistency Testing
Yonatan Aumann, Johan Håstad, Michael O. Rab...
RANDOM
1999
Springer
13 years 9 months ago
Approximating Minimum Manhattan Networks
Joachim Gudmundsson, Christos Levcopoulos, Giri Na...
RANDOM
1999
Springer
13 years 9 months ago
Scheduling with Unexpected Machine Breakdowns
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
Susanne Albers, Günter Schmidt
RANDOM
1999
Springer
13 years 9 months ago
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
Seth Pettie, Vijaya Ramachandran