Results 1  10
of
465,145
Nonindependent Randomized Rounding
 In Proc. ACMSIAM Symposium on Discrete Algorithms
, 2003
"... We investigate an extension of the randomized rounding technique introduced by Raghavan and Thompson. Whereas their approach only requires that each variable is rounded with probabilities given by its fractional part, we also impose this condition on several sums of variables. Thus in particular our ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
We investigate an extension of the randomized rounding technique introduced by Raghavan and Thompson. Whereas their approach only requires that each variable is rounded with probabilities given by its fractional part, we also impose this condition on several sums of variables. Thus in particular
Structured Randomized Rounding and Coloring
 Fundamentals of Computation Theory
, 2001
"... . In this paper we propose an advanced randomized coloring algorithm for the problem of balanced colorings of hypergraphs (discrepancy problem). It allows to use structural information about the hypergraph in the design of the random experiment. This yields colorings having smaller discrepancy t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
their discrepancy can be done faster. We apply our method to hypergraphs of d{dimensional boxes. Among others, we observe a factor 2 d=2 decrease in discrepancy and a reduction of the number of random bits needed by a factor of 2 d . Since the discrepancy problem is a particular rounding problem, our
Randomized Rounding without Solving the Linear Program
 In Proceedings of the Sixth Annual ACMSIAM Symposium on Discrete Algorithms
, 1995
"... We introduce a new technique called oblivious rounding  a variant of randomized rounding that avoids the bottleneck of first solving the linear program. Avoiding this bottleneck yields more efficient algorithms and brings probabilistic methods to bear on a new class of problems. We give oblivious ..."
Abstract

Cited by 93 (6 self)
 Add to MetaCart
We introduce a new technique called oblivious rounding  a variant of randomized rounding that avoids the bottleneck of first solving the linear program. Avoiding this bottleneck yields more efficient algorithms and brings probabilistic methods to bear on a new class of problems. We give
Dependent Randomized Rounding: The Bipartite Case
, 2011
"... We analyze the two existing algorithms to generate dependent randomized roundings for the bipartite edge weight rounding problem together with several newly proposed variants of these algorithms. For both the edgebased approach of Gandhi, Khuller, Parthasarathy, Srinivasan (FOCS 2002) and the bitw ..."
Abstract
 Add to MetaCart
We analyze the two existing algorithms to generate dependent randomized roundings for the bipartite edge weight rounding problem together with several newly proposed variants of these algorithms. For both the edgebased approach of Gandhi, Khuller, Parthasarathy, Srinivasan (FOCS 2002) and the bit
Scheduling Unrelated Machines by Randomized Rounding
 SIAM Journal on Discrete Mathematics
, 1999
"... In this paper, we provide a new class of randomized approximation algorithms for parallel machine scheduling problems. The most general model we consider is scheduling unrelated machines with release dates (or even network scheduling) so as to minimize the average weighted completion time. We introd ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
In this paper, we provide a new class of randomized approximation algorithms for parallel machine scheduling problems. The most general model we consider is scheduling unrelated machines with release dates (or even network scheduling) so as to minimize the average weighted completion time. We
A RandomnessRounds Tradeoff in Private Computation
"... We study the role of randomness in multiparty private computations. In particular, we give several results that prove the existence of a randomnessrounds tradeoff in multiparty private computation of xor. We show that with a single random bit, Θ(n) rounds are necessary and sufficient to ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
We study the role of randomness in multiparty private computations. In particular, we give several results that prove the existence of a randomnessrounds tradeoff in multiparty private computation of xor. We show that with a single random bit, Θ(n) rounds are necessary and sufficient
Approximation Algorithms Via Randomized Rounding: A Survey
 Series in Advanced Topics in Mathematics, Polish Scientific Publishers PWN
, 1999
"... Approximation algorithms provide a natural way to approach computationally hard problems. There are currently many known paradigms in this area, including greedy algorithms, primaldual methods, methods based on mathematical programming (linear and semidefinite programming in particular), local i ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
improvement, and "low distortion" embeddings of general metric spaces into special families of metric spaces. Randomization is a useful ingredient in many of these approaches, and particularly so in the form of randomized rounding of a suitable relaxation of a given problem. We survey
Generating randomized roundings with cardinality constraints and derandomizations
 In 23rd Annual Symposium on Theoretical Aspects of Computer Science
, 2006
"... Abstract. We provide a general method to generate randomized roundings that satisfy cardinality constraints. Our approach is different from the one taken by Srinivasan (FOCS 2001) and Gandhi et al. (FOCS 2002) for one global constraint and the bipartite edge weight rounding problem. Also for these s ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
Abstract. We provide a general method to generate randomized roundings that satisfy cardinality constraints. Our approach is different from the one taken by Srinivasan (FOCS 2001) and Gandhi et al. (FOCS 2002) for one global constraint and the bipartite edge weight rounding problem. Also
Nearperfect load balancing by randomized rounding
 In 41st Annual ACM Symposium on Theory of Computing (STOC’09
, 2009
"... We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and minimum load. In every timestep paired processors balance their load as evenly as possible. The direction of the excess t ..."
Abstract

Cited by 15 (9 self)
 Add to MetaCart
token is chosen according to a randomized rounding of the participating loads. We prove that in comparison to the corresponding model of Rabani, Sinclair, and Wanka (1998) with arbitrary roundings, the randomization yields an improvement of roughly a square root of the achieved discrepancy in the same
Results 1  10
of
465,145