Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Randomized rounding: A technique for provably good algorithms and algorithmic proofs |
scientific article; zbMATH DE number 4062820
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomized rounding: A technique for provably good algorithms and algorithmic proofs |
scientific article; zbMATH DE number 4062820 |
Statements
Randomized rounding: A technique for provably good algorithms and algorithmic proofs (English)
0 references
1987
0 references
The relation between special 0-1 integer linear programs (routing in VLSI circuits, multicommodity flow problems, k-matching) and their rational relaxations is studied. The authors consider a randomized rounding for transforming an optimal solution of the relaxation problem into a provably good solution for the 0-1 problem. Some probabilistic estimations about the existence of good integer solutions are derived.
0 references
integer linear programs
0 references
routing in VLSI circuits
0 references
multicommodity flow problems
0 references
k-matching
0 references
rational relaxations
0 references
randomized rounding
0 references
probabilistic estimations
0 references
0 references
