Randomized rounding

Within computer science and operations research,many combinatorial optimization problems are computationally intractable to solve exactly (to… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
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
The Steiner tree problem is one of the most fundamental NP-hard problems: given a weighted undirected graph and a subset of… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2011
Highly Cited
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)
  • figure 1
Is this relevant?
2011
2011
We develop a new dependent randomized rounding method for approximation of a number of optimization problems with integral… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
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
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is… (More)
  • table 1
  • figure 1
Is this relevant?
Highly Cited
2002
Highly Cited
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
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
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
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?