Randomized rounding: A technique for provably good algorithms and algorithmic proofs

@article{Raghavan1987RandomizedRA,
  title={Randomized rounding: A technique for provably good algorithms and algorithmic proofs},
  author={Prabhakar Raghavan and Clark D. Thomborson},
  journal={Combinatorica},
  year={1987},
  volume={7},
  pages={365-374}
}
We study the relation between a class of 0–1 integer linear programs and their rational relaxations. We give a randomized algorithm for transforming an optimal solution of a relaxed problem into a provably good solution for the 0–1 problem. Our technique can be a of extended to provide bounds on the disparity between the rational and 0–1 optima for a given problem instance. 
Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs
TLDR
A methodology for converting a probabilistic existence proof to a deterministic approximation algorithm that mimics the existence proof in a very strong sense is developed. Expand
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
  • P. Raghavan
  • Computer Science
  • 27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
  • 1986
TLDR
A methodology for converting a probabilistic existence proof to a deterministic approximation algorithm that mimics the existence proof in a very strong sense is developed. Expand
Randomized rounding without solving the linear program
  • N. Young
  • Mathematics, Computer Science
  • SODA '95
  • 1995
TLDR
A new technique called oblivious rounding is introduced a variant of randomized rounding that avoids the bottleneck of first solving the linear program, which yields more efficient algorithms and brings probabilistic methods to bear on a new class of problems. Expand
A deterministic approximation algorithm for a minmax integer programming problem
  • Chi-Jen Lu
  • Mathematics, Computer Science
  • SODA '99
  • 1999
TLDR
A deterministic polynomial time approximation algorithm is given, achieving the best existential bound given by Srinivasan, for a minmax integer programming problem, which has a hypergraph coloring problem as its special case. Expand
Analysis of randomised rounding for integer programs
We use randomised rounding to obtain an upper bound for the optimum value of the program {min cx | A x ≥ b, x ≥ 0, x is an integer vector}, where b > 0, c ≥ 0 are rational vectors and A is anExpand
Improved Approximation Guarantees for Packing and Covering Integer Programs
TLDR
This work uses the FKG correlation inequality to derive an improved analysis of randomized rounding on integer linear programs and yields a pessimistic estimator, thus presenting deterministic polynomial-time algorithms for them with approximation guarantees that are significantly better than those known. Expand
On dependent randomized rounding algorithms
TLDR
This paper describes a class of rounding methods that exploits the structure and geometry of the underlying problem to round fractional solution to 0-1 solution and shows that this technique can be used to establish the integrality of several classical polyhedra. Expand
Approximation algorithms via randomized rounding : a survey
Approximation algorithms provide a natural way to approach computationally hard problems. There are currently many known paradigms in this area, including greedy algorithms, primal-dual methods,Expand
Combinatorial Randomized Rounding: Boosting Randomized Rounding with Combinatorial Arguments
Randomized Rounding (RR) is a simple and very efficient probabilistic method to convert a solution of a relaxed combinatorial optimization (CO) problem into an approximate solution to the originalExpand
On Dependent Randomized Rounding Algorithms
TLDR
A class of rounding methods is described that exploits the structure and geometry of the underlying problem to round fractional solution to 0–1 solution and can be used to establish the integrality of several classical polyhedra. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 15 REFERENCES
Provably good routing in graphs: regular arrays
We examine the problem of routing wires on a VLSI chip where the nodes to be connected are arranged in a two-dimensional array. We develop provably good algorithms that find a solution close to theExpand
Dual integer linear programs and the relationship between their optima
TLDR
This work considers dual pairs of packing and covering integer linear programs and finds best possible bounds between their optimal values. Expand
On the ratio of optimal integral and fractional covers
  • L. Lovász
  • Computer Science, Mathematics
  • Discret. Math.
  • 1975
It is shown that the ratio of optimal integral and fractional covers of a hypergraph does not exceed 1 + log d, where d is the maximum degree. This theorem may replace probabilistic methods inExpand
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings
TLDR
Three simple efficient algorithms with good probabilistic behaviour are described and an algorithm with a run time of O ( n log n ) which almost certainly finds a perfect matching in a random graph of at least cn log n edges is analyzed. Expand
On the Complexity of Timetable and Multicommodity Flow Problems
A very primitive version of Gotlieb’s timetable problem is shown to be NP-complete, and therefore all the common timetable problems are NP-complete. A polynomial time algorithm, in case all teachersExpand
Global Wire Routing in Two-Dimensional Arrays (Extended Abstract)
TLDR
An interesting "rounding algorithm" for obtaining integral approximations to solutions of linear equations is used to show the near-optimality of single-turn routings in the worst-case. Expand
On the complexity of time table and multi-commodity flow problems
  • S. Even, A. Itai, A. Shamir
  • Computer Science
  • 16th Annual Symposium on Foundations of Computer Science (sfcs 1975)
  • 1975
TLDR
The theorem that a meeting function always exists if all teachers and classes have no time constraints is proved and the multi-commodity integral flow problem is shown to be NP-complete even if the number of commodities is two. Expand
A decomposition algorithm for circuit routing
TLDR
This work recursively cuts the area of the chip into smaller and smaller regions until the routing problem within a region can be handled by the Dantzig-Wolfe decomposition method, and successively paste the adjacent regions together to obtain the routing of the whole chip. Expand
Maximum degree and fractional matchings in uniform hypergraphs
TLDR
This paper proves a corollary to a more general theorem on not necessarily intersecting hypergraphs, and says that ℋ is intersecting if for anyH,H′ ∈ℋ H ∩H′ ≠ 0. Expand
An O(|V|³) Algorithm for Finding Maximum Flows in Networks
TLDR
An O(V cubed) algorithm is given for finding maximum flow in capacitated networks and is being posted here to make it accessible to all in electronic form. Expand
...
1
2
...