APPROX
2006
Springer
13 years 8 months ago
2006
Springer
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parame...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
Given an m
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...