|
|
96203daa3d
|
is there any embedding thm only bounding small number of vertices?
|
2025-05-23 11:01:33 +08:00 |
|
|
|
4e8f62a293
|
what's next?...
|
2025-05-21 23:28:36 +08:00 |
|
|
|
56a0c84bce
|
l1 gap is 1
|
2025-05-21 15:22:53 +08:00 |
|
|
|
9722f3e187
|
intuition of metric methods
|
2025-05-21 14:53:12 +08:00 |
|
|
|
32ae555c29
|
fix wrong math
|
2025-05-21 14:08:18 +08:00 |
|
|
|
3ae08afcb0
|
fix wrong math
|
2025-05-20 18:52:48 +08:00 |
|
|
|
cecdc0660e
|
eat
|
2025-05-20 17:20:36 +08:00 |
|
|
|
66fde92bd0
|
fix wrong facts in intro
|
2025-05-20 14:31:23 +08:00 |
|
|
|
f1940dc17f
|
...
|
2025-05-19 21:42:28 +08:00 |
|
|
|
cb42b52ba0
|
proof of the log n flow cut gap.
|
2025-05-19 20:05:15 +08:00 |
|
|
|
ffa6568d81
|
sdp approximation
|
2025-05-18 15:40:19 +08:00 |
|
|
|
c1a929801f
|
flow-cut gap is Theta(log n)
|
2025-05-16 16:43:07 +08:00 |
|
|
|
83b04947a8
|
the Omega(log n) lb
|
2025-05-15 18:32:28 +08:00 |
|
|
|
cbbef6a21f
|
remove sections
|
2025-05-15 11:47:24 +08:00 |
|
|
|
d19ad14e46
|
remove natbib. some flow-cut gap
|
2025-05-15 10:59:22 +08:00 |
|
|
|
ed771de39a
|
typo & JP theorem
|
2025-05-14 10:29:02 +08:00 |
|
|
|
f1f1935565
|
jp thm
|
2025-05-14 00:47:33 +08:00 |
|
|
|
e68ec80449
|
LP relations
|
2025-05-14 00:18:57 +08:00 |
|
|
|
8b8dc60d34
|
how to show that y_i is the distance...?
|
2025-05-13 21:17:34 +08:00 |
|
|
|
9ccff75dea
|
commit for dinner
|
2025-05-13 17:33:37 +08:00 |
|
|
|
ac419b7e12
|
lp notes
|
2025-05-13 16:38:11 +08:00 |
|
|
|
e9161135ae
|
misleading typo
|
2025-05-11 14:22:14 +08:00 |
|
|
|
5a59d520fe
|
...
|
2025-05-10 15:40:08 +08:00 |
|
|
|
81c7b05c9b
|
submit homework
|
2025-05-10 15:37:13 +08:00 |
|
|
|
2cdc315849
|
approx rate for general graph sparsest cut
|
2025-05-10 14:36:22 +08:00 |
|
|
|
a4b9fbaaeb
|
intro done
|
2025-05-10 00:14:56 +08:00 |
|
|
|
717495e654
|
hardness
|
2025-05-09 23:40:53 +08:00 |
|
|
|
7ec74ff9d1
|
first commit
|
2025-05-09 23:07:38 +08:00 |
|
