Quartz 5
Search
Search
Dark mode
Light mode
Reader mode
uni/aa
108 items with this tag.
Sep 22, 2026
Graphic Matroids
uni/aa
Sep 22, 2026
AA UE 8
uni/aa
Sep 22, 2026
makespan
uni/aa
Sep 22, 2026
AA UE 6
uni/aa
Sep 22, 2026
AA UE 7
uni/aa
Sep 22, 2026
Advanced Algorithms UE 3
uni/aa
Sep 22, 2026
Characterizations of Matroids
uni/aa
Sep 22, 2026
Linear Matroids
uni/aa
Sep 22, 2026
Advanced Algorithms UE 8
uni/aa
Sep 22, 2026
AA UE 3
uni/aa
Sep 22, 2026
AA UE 2
uni/aa
Sep 22, 2026
Advanced Algorithms UE 5
uni/aa
Sep 22, 2026
Edmonds-Gallai Decomposition
uni/aa
Sep 22, 2026
Incidence matrix
uni/aa
Sep 22, 2026
Independence Systems
uni/aa
Sep 22, 2026
Minimizing the Makespan
uni/aa
Sep 22, 2026
Every path with exposed Endpoints is either a Flower or M-alternating
uni/aa
Sep 22, 2026
Linear Inequalities
uni/aa
Sep 22, 2026
Gale-Shapley Algorithm
uni/aa
Sep 22, 2026
Matching Matroids
uni/aa
Sep 22, 2026
Maximum Matching as LP
uni/aa
Sep 22, 2026
Linear Programming
uni/aa
Sep 22, 2026
Bases of a Matroid
uni/aa
Sep 22, 2026
Complementary Slackness
uni/aa
Sep 22, 2026
Tutte-Berge Formula
uni/aa
Sep 22, 2026
Blocking Flows
uni/aa
Sep 22, 2026
Bipartite matching via Alternating Paths
uni/aa
Sep 22, 2026
Advanced Algorithms UE 6
uni/aa
Sep 22, 2026
sum of completion times
uni/aa
Sep 22, 2026
Flow Optimality criteria
uni/aa
Sep 22, 2026
Matroids
uni/aa
Sep 22, 2026
Three field notation
uni/aa
Sep 22, 2026
Scheduling Problems
uni/aa
Sep 22, 2026
Circulation
uni/aa
Sep 22, 2026
LP Extreme points
uni/aa
Sep 22, 2026
AA Flashcards Min Cost Flow
uni/aa
q
aosr/29ak7
aosr/29ak7/m/6lvj
aosr/62vk4
aosr/62vk4/m/3evo
aosr/2gp6j
aosr/2gp6j/m/4d5v
aosr/sus70
aosr/sus70/m/36dn
aosr/2qrdf
aosr/2qrdf/m/3iqb
aosr/572nf
aosr/572nf/m/206a
Sep 22, 2026
Minimum-Cost Flow as LP
uni/aa
Sep 22, 2026
AA UE 1
uni/aa
Sep 22, 2026
Partition Matroids
uni/aa
Sep 22, 2026
LP Duality
uni/aa
Sep 22, 2026
Simplex method LP slover
uni/aa
Sep 22, 2026
AA Flashcards LP
uni/aa
q
aosr/3i8k8
aosr/3i8k8/m/1bsv
aosr/7ah83
aosr/7ah83/m/69kv
aosr/ufpi9
aosr/ufpi9/m/2shk
aosr/4vbg4
aosr/4vbg4/m/6teb
aosr/6vm3r
aosr/6vm3r/m/1v59
aosr/5lqlf
aosr/5lqlf/m/283d
aosr/gk1pe
aosr/gk1pe/m/76rt
aosr/7b38j
aosr/7b38j/m/24n6
aosr/for8d
aosr/for8d/m/45l1
aosr/766o1
aosr/766o1/m/61ca
aosr/6lc0f
aosr/6lc0f/m/66b0
aosr/1ajp0
aosr/1ajp0/m/6pjn
aosr/7uivm
aosr/7uivm/m/6ovm
aosr/73mbm
aosr/73mbm/m/6m49
Sep 22, 2026
Max-Height Algorithm
uni/aa
Sep 22, 2026
Stable marriage problem
uni/aa
Sep 22, 2026
Linear Equations
uni/aa
Sep 22, 2026
Reduktion Maximum Matching auf Max-Fluss Problem
uni/aa
Sep 22, 2026
Non-Bipartie Matching via M-Alternating Paths
uni/aa
Sep 22, 2026
Minimum-cost bipartite matching
uni/aa
Sep 22, 2026
Simple s-t-Networks
uni/aa
Sep 22, 2026
Strong Duality
uni/aa
Sep 22, 2026
AA Flashcards Materoids
uni/aa
q
aosr/vp6q3
aosr/vp6q3/m/186m
aosr/408vc
aosr/408vc/m/479c
aosr/6kde6
aosr/6kde6/m/2cg0
aosr/53h4p
aosr/53h4p/m/6f2s
aosr/39rem
aosr/39rem/m/632g
aosr/7b0ut
aosr/7b0ut/m/32s0
aosr/6to2q
aosr/6to2q/m/3luk
aosr/13lq7
aosr/13lq7/m/7dk1
aosr/5442v
aosr/5442v/m/6bug
aosr/7bjmh
aosr/7bjmh/m/6tho
aosr/42ntu
aosr/42ntu/m/4ukf
aosr/f8od0
aosr/f8od0/m/9k9h
aosr/4dbgi
aosr/4dbgi/m/r0ch
aosr/5sb90
aosr/5sb90/m/4rnl
aosr/6u36m
aosr/6u36m/m/7qog
aosr/dlruh
aosr/dlruh/m/5f0e
aosr/j28lu
aosr/j28lu/m/2pmc
Sep 22, 2026
AA Flashcards perfekt, weighted und stable Matching
uni/aa
q
aosr/4t45n
aosr/4t45n/m/53kl
aosr/10k1u
aosr/10k1u/m/1jta
aosr/3mlnm
aosr/3mlnm/m/3iqd
aosr/7ftkj
aosr/7ftkj/m/ko43
aosr/17skd
aosr/17skd/m/edf4
aosr/5k6aq
aosr/5k6aq/m/t9ho
aosr/tgfc8
aosr/tgfc8/m/7bll
aosr/12css
aosr/12css/m/qd7s
aosr/6u3jd
aosr/6u3jd/m/1l96
aosr/6olo2
aosr/6olo2/m/5nfb
aosr/3t7to
aosr/3t7to/m/7n44
aosr/4ujm0
aosr/4ujm0/m/15o5
aosr/1vug3
aosr/1vug3/m/24bh
aosr/29nbh
aosr/29nbh/m/3gld
aosr/3fi9g
aosr/3fi9g/m/6bi8
aosr/15eit
aosr/15eit/m/3im5
Sep 22, 2026
Advanced Algorithms UE 10
uni/aa
Sep 22, 2026
symmetric Difference
uni/aa
Sep 22, 2026
Preemptive jobs
uni/aa
Sep 22, 2026
Advanced Algorithms UE 4
uni/aa
Sep 22, 2026
König’s Theorem
uni/aa
Sep 22, 2026
Maximum Matching
uni/aa
Sep 22, 2026
AA UE 0
uni/aa
Sep 22, 2026
Generic Cycle-Canceling Algorithm
uni/aa
Sep 22, 2026
Weighted Vertex Cover as LP
uni/aa
Sep 22, 2026
factor critical matching
uni/aa
Sep 22, 2026
LP Präsi
uni/aa
Sep 22, 2026
Graph as Totally Unimodular Matrix
uni/aa
Sep 22, 2026
Non-preemptive jobs
uni/aa
Sep 22, 2026
Edmonds and Karp Algoritums
uni/aa
Sep 22, 2026
Uniform Matroids
uni/aa
Sep 22, 2026
Modify Flowers
uni/aa
Sep 22, 2026
AA UE 9
uni/aa
Sep 22, 2026
LP Optimization = Separation
uni/aa
Sep 22, 2026
AA Flashcards Maximum Matching and Flows
uni/aa
q
aosr/2a6va
aosr/2a6va/m/57nc
aosr/41fui
aosr/41fui/m/3h1v
aosr/47k21
aosr/47k21/m/4otc
aosr/26u2s
aosr/26u2s/m/6jcm
aosr/1bl7g
aosr/1bl7g/m/33v3
aosr/7uiuu
aosr/7uiuu/m/1bv7
aosr/2uhhj
aosr/2uhhj/m/5l29
aosr/5nl0b
aosr/5nl0b/m/28fs
aosr/54r5v
aosr/54r5v/m/3c5c
aosr/3bl1d
aosr/3bl1d/m/5t67
aosr/qd6jt
aosr/qd6jt/m/46qj
aosr/pang5
aosr/pang5/m/5ji4
aosr/2odhc
aosr/2odhc/m/7i76
aosr/272d5
aosr/272d5/m/29bu
aosr/1nrna
aosr/1nrna/m/6dfk
aosr/13l9v
aosr/13l9v/m/7r1c
aosr/1ei90
aosr/1ei90/m/7hku
aosr/2dea9
aosr/2dea9/m/50n3
aosr/6ckn3
aosr/6ckn3/m/21q9
aosr/2l9n7
aosr/2l9n7/m/5bqs
aosr/3fkeq
aosr/3fkeq/m/4pa7
aosr/337he
aosr/337he/m/7rf6
aosr/2b6ri
aosr/2b6ri/m/2ljc
aosr/3sn7a
aosr/3sn7a/m/21dr
aosr/698ik
aosr/698ik/m/58c1
aosr/1q3jm
aosr/1q3jm/m/2rbp
aosr/24bj3
aosr/24bj3/m/5mdt
aosr/3ptb9
aosr/3ptb9/m/68sq
aosr/44g5v
aosr/44g5v/m/2ibm
aosr/493pj
aosr/493pj/m/7uqo
aosr/1nuh9
aosr/1nuh9/m/7s7r
aosr/6fcd3
aosr/6fcd3/m/15vh
aosr/thhep
aosr/thhep/m/65gi
Sep 22, 2026
Advanced Algorithms Lernplan
uni/aa
Sep 22, 2026
Advanced Algorithms UE 1
uni/aa
Sep 22, 2026
Network with Cost
uni/aa
Sep 22, 2026
AA UE 10
uni/aa
Sep 22, 2026
Schrinking a blossom
uni/aa
Sep 22, 2026
AA UE 4
uni/aa
Sep 22, 2026
Matroid optimization
uni/aa
Sep 22, 2026
Convex set
uni/aa
Sep 22, 2026
Graph Flower
uni/aa
Sep 22, 2026
The Knapsack Problem as LP
uni/aa
Sep 22, 2026
Advanced Algorithms UE 2
uni/aa
Sep 22, 2026
Advanced Algorithms UE 9
uni/aa
Sep 22, 2026
Minmal Vertex Cover as LP
uni/aa
Sep 22, 2026
Unrelated Maschines
uni/aa
Sep 22, 2026
Preflows
uni/aa
Sep 22, 2026
Dinitz’ Algorithm
uni/aa
Sep 22, 2026
Minimum-Mean Cycle Algorithm
uni/aa
Sep 22, 2026
Min-Sum Scheduling
uni/aa
Sep 22, 2026
Advanced Algorithms MOC
map
uni/aa
Sep 22, 2026
Max-Flow Min-Cut Theorem
uni/aa
Sep 22, 2026
Min Cost Flow
uni/aa
Sep 22, 2026
Weighted Bipartite Matchings
uni/aa
Sep 22, 2026
Integer Linear Programs
uni/aa
Sep 22, 2026
AA Flashcards Scheduling Problems
uni/aa
q
aosr/4inlr
aosr/4inlr/m/7hli
aosr/6t75j
aosr/6t75j/m/7ams
aosr/3k1ik
aosr/3k1ik/m/5agm
aosr/251t3
aosr/251t3/m/z355
aosr/1gh8s
aosr/1gh8s/m/1nib
aosr/5gejs
aosr/5gejs/m/722n
aosr/61hc2
aosr/61hc2/m/134n
Sep 22, 2026
Weak Duality
uni/aa
Sep 22, 2026
Satz von Berge
uni/aa
Sep 22, 2026
Minimal Spanning Tree
uni/aa
Sep 22, 2026
Stable Matchings
uni/aa
Sep 22, 2026
LP relaxations
uni/aa
Sep 22, 2026
Ellipsoid method LP slover
uni/aa
Sep 22, 2026
s-t-Cut
uni/aa
Sep 22, 2026
Flow Augmenting Paths
uni/aa
Sep 22, 2026
Totally Unimodular Matrices
uni/aa
Sep 22, 2026
Advanced Algorithms UE 7
uni/aa
Sep 22, 2026
LP solution space
uni/aa
Sep 22, 2026
extreme Matching
uni/aa
Sep 22, 2026
AA UE 5
uni/aa