Sign inSign in
ConceptEngineering

Rounding

Quickly searching and turning fractional convex relaxation solutions into discrete binary path solutions.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Convex relaxation1Graph search1Linear programming rounding1SDP relaxation1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    The process of converting a fractional or vector solution of a relaxation back into an integer or discrete solution.
    • 17:23Goemans-Williamson Algorithm: Rounding the Max-Cut SDP

Lectures that assume it

2

Connections

9

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.