# Randomized rounding

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- STOC
- 2015

The maximum volume j-simplex problem asks to compute the j-dimensional simplex of maximum volume inside the convex hull of a… (More)

Is this relevant?

Highly Cited

2013

Highly Cited

2013

- J. ACM
- 2013

The Steiner tree problem is one of the most fundamental NP-hard problems: given a weighted undirected graph and a subset of… (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- IEEE 52nd Annual Symposium on Foundations of…
- 2011

For some positive constant \eps_0, we give a (3/2-\eps_0)-approximation algorithm for the following problem: given a graph G_0=(V… (More)

Is this relevant?

2011

2011

- J. Comb. Optim.
- 2011

We develop a new dependent randomized rounding method for approximation of a number of optimization problems with integral… (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- IEEE 51st Annual Symposium on Foundations of…
- 2010

We consider the problem of randomly rounding a fractional solution $x$ in an integer polytope $P \subseteq [0,1]^n$ to a vertex… (More)

Is this relevant?

2009

2009

- STOC
- 2009

We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- SIAM J. Discrete Math.
- 2002

In this paper, we provide a new class of randomized approxima tion lgorithms for parallel machine scheduling problems. The most… (More)

Is this relevant?

1996

1996

- IPCO
- 1996

In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- SODA
- 1995

We introduce a new technique called oblivious rounding a variant of randomized rounding that avoids the bottleneck of first… (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- Combinatorica
- 1985

The relation of an integer program to its rational relaxation has been the subject of considerable interest [l], [5], [11]. Such… (More)

Is this relevant?