Skip to content

CSCI4240 · 4

Chapter outline · Randomized rounding

Definitions and theorem statements recorded in the web, in note order, with the exact proof steps behind their recorded connections.

0 of 5 public sections have indexed statements. This outline covers only those statements, not every theorem in the chapter. Recorded connections are still being reviewed.

4.1

Randomized rounding for set cover

0 recorded theorems · 0 recorded definitions

Statements from this section are not indexed yet. Read the original note for its definitions and theorems.

4.2

Why linear-programming duality is exact

0 recorded theorems · 0 recorded definitions

Statements from this section are not indexed yet. Read the original note for its definitions and theorems.

4.3

Set cover: charging, linear relaxations, and primal–dual certificates

0 recorded theorems · 0 recorded definitions

Statements from this section are not indexed yet. Read the original note for its definitions and theorems.

4.4

Metric traveling-salesperson approximation

0 recorded theorems · 0 recorded definitions

Statements from this section are not indexed yet. Read the original note for its definitions and theorems.

4.5

A fully polynomial scheme for knapsack

0 recorded theorems · 0 recorded definitions

Statements from this section are not indexed yet. Read the original note for its definitions and theorems.

Vercel visit statistics and public-page performance measurements each require separate consent. Neither is needed to use the website.

Website function storage (used when needed)

Security, sign-in and your chosen preferences use storage when needed. This is separate from optional statistics.

Withdrawing stops future statistics. The page reloads if analytics code needs unloading. It does not delete data already sent.

Read Cookie and storage details