Live briefing
Everything about Randomized rounding
In computer science and operations research, randomized rounding is a widely used approach for designing and analyzing approximation algorithms. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Randomized roundingA 5-minute orientation
- Skim a recent paper: Discharge in the a.m.: A randomized controlled trial of physician rounding styles to improve hospital throughput and length of stayInfluential work since 2022
- Pick up a classic book: Le Tour du Monde en Quatre-Vingts JoursThe most-reprinted book on the subject
- Read the landmark paper: Randomized rounding: A technique for provably good algorithms and algorithmic proofsCited 746 times
- Go sideways: Tau function (integrable systems)A closely related topic
- Go sideways: Kernel embedding of distributionsA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
Steiner Tree Approximation via Iterative Randomized Rounding
Scheduling Unrelated Machines by Randomized Rounding
Virtual Network Embedding Approximations: Leveraging Randomized Rounding
Heatmap Regression via Randomized Rounding
On dependent randomized rounding algorithms
Randomized Algorithms for Rounding in the Tensor-Train Format
Multistage Lot Sizing Problems via Randomized Rounding
🆕 Influential since 2022
Discharge in the a.m.: A randomized controlled trial of physician rounding styles to improve hospital throughput and length of stay
Node connectivity augmentation via iterative randomized rounding
Using Randomized Rounding of Linear Programs to Obtain Unweighted Natural Strata that Balance Many Covariates
Utilization of Text Messages to Supplement Rounding Communication: a Randomized Feasibility Study
Proportionally Fair Matching via Randomized Rounding
📚 Books worth reading
Le Tour du Monde en Quatre-Vingts JoursJules Verne · 1872
Le Morte d'ArthurThomas Malory · 1557
ThumbelinaHans Christian Andersen, Elsa Beskow · 1911
Round the BendNevil Shute · 1951
King Arthur and His Knights of the Round TableRoger Lancelyn Green · 1953
The World is RoundGertrude Stein, Clement Hurd · 1939
The Sword and the CircleRosemary Sutcliff, Thomas Malory · 1981
Round Ireland with a fridgeTony Hawks · 1998
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Tau function (integrable systems) Tau functions are an important ingredient in the modern mathematical theory of integrable systems, and have numerous applications in a variety of other…
- Kernel embedding of distributions In machine learning, the kernel embedding of distributions (also called the kernel mean or mean map) comprises a class of nonparametric methods in which…
- Stochastic game In game theory, a stochastic game (or Markov game) is a repeated game with probabilistic transitions played by one or more players. The game is played…
- Quantum optimization algorithms Quantum optimization algorithms are quantum algorithms that are used to solve optimization problems. Mathematical optimization deals with finding the best…
- Linear programming relaxation In mathematics, the relaxation of a (mixed) integer linear program is the problem that arises by removing the integrality constraint of each variable.…
- Doob's martingale inequality In mathematics, Doob's martingale inequality, also known as Kolmogorov's submartingale inequality, is a fundamental result in the study of stochastic processes…
- Markov kernel In probability theory, a Markov kernel (also known as a stochastic kernel or probability kernel) is a map that in the general theory of Markov processes…
- Λ-ring In algebra, a λ-ring or lambda ring is a commutative ring together with some operations λn on it that behave like the exterior powers of vector spaces…