Randomized rounding is a widely used technique in computer science and operations research for designing and analyzing approximation algorithms. It works by taking the optimal solution to a relaxation of a computationally intractable combinatorial optimization problem and using probabilistic analysis to round it into an approximately optimal solution to the original problem. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Design TechniqueHeuristic or Approximation 1 Sources
1. Wikipedia: Randomized rounding
entity record, description (design-technique)Quote, entity record, description (design-technique)
Randomized rounding is a widely used technique in computer science and operations research for designing and analyzing approximation algorithms.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.