Trance-0/NoteNextra-origin
1
0
Fork 0
Code Issues Pull Requests Actions 1 Packages Projects Releases Wiki Activity

update notations and fix typos

Browse Source
This commit is contained in:
Zheyuan Wu
2025-02-25 20:41:35 -06:00
parent 419ea07352
commit 27bff83685
71 changed files with 920 additions and 430 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
pages/CSE347/CSE347_L8.md
View File

@@ -153,7 +153,7 @@ Summing over all vertices, the total number of crossing edges is at least $\frac
So the total number of non-crossing edges is at most $\frac{|E|}{2}$.
EOP
QED
#### Set cover
@@ -264,7 +264,7 @@ So $n(1-\frac{1}{k})^{|C|-1}=1$, $|C|\leq 1+k\ln n$.
So the size of the set cover found is at most $(1+\ln n)k$.
EOP
QED
So the greedy set cover is not too bad...
@@ -350,4 +350,4 @@ $$
So the approximation ratio for greedy set cover is $H_d$.
EOP
QED