Nina Overflow
All posts
Log in
Loading ā¦
Topic groups
/
A&W
+ New post
View
List
š Folders
Subtopic
All
6
flow
2
MIN-CUT
2
probabilistic algorithms
2
probability
1
āø More filters
ā¾ Fewer filters
Folders
by Subtopic
by Person
by Type
by Status
Type
All
6
? Questions
4
! Remarks
1
ā Resources
1
Sort
Newest
Unanswered first
Most relevant
Status
All
6
Open
4
Closed
1
Topic
A&W
Analysis 1
Lineare Algebra
Parallel Programming
other
Time
last
days
Apply
š
killerbunny
1
?
Which max-flow algorithm should we focus on for the exam?
open
flow
MIN-CUT
ā² 0
same question: 0
0 answers
killerbunny
Ā· 1 min ago
š
max
2
!
Lecture 9 slide 14: max-flow value stated with a wrong constant
open
flow
ā² 0
confirmed by: 0
0 answers
max
Ā· 1 min ago
?
Why does Karger's MIN-CUT algorithm succeed with probability ā„ 2/(n(nā1))?
open
probabilistic algorithms
MIN-CUT
ā² 0
same question: 0
1 answer
max
Ā· 1 min ago
š
nina
3
ā
Cheat-sheet: tail bounds (Markov, Chebyshev, Chernoff) with when to use each
probability
probabilistic algorithms
ā² 0
nina
Ā· 1 min ago
?
images
ā closed
ā² 0
same question: 0
1 answer
nina
Ā· 10 h ago
?
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
open
ā² 0
same question: 0
0 answers
nina
Ā· 12 h ago
