Quartz 4
Search
Search
Dark mode
Light mode
Explorer
Tag: uni/AA
109 items with this tag.
Dec 06, 2025
Graphic Matroids
uni/AA
Dec 06, 2025
AA UE 8
uni/AA
Dec 06, 2025
makespan
uni/AA
Dec 06, 2025
AA UE 6
uni/AA
Dec 06, 2025
AA UE 7
uni/AA
Dec 06, 2025
Advanced Algorithms UE 3
uni/AA
Dec 06, 2025
Characterizations of Matroids
uni/AA
Dec 06, 2025
Linear Matroids
uni/AA
Dec 06, 2025
Advanced Algorithms UE 8
uni/AA
Dec 06, 2025
AA UE 3
uni/AA
Dec 06, 2025
AA UE 2
uni/AA
Dec 06, 2025
Advanced Algorithms UE 5
uni/AA
Dec 06, 2025
Edmonds-Gallai Decomposition
uni/AA
Dec 06, 2025
Incidence matrix
uni/AA
Dec 06, 2025
Independence Systems
uni/AA
Dec 06, 2025
Minimizing the Makespan
uni/AA
Dec 06, 2025
Every path with exposed Endpoints is either a Flower or M-alternating
uni/AA
Dec 06, 2025
Linear Inequalities
uni/AA
Dec 06, 2025
Gale-Shapley Algorithm
uni/AA
Dec 06, 2025
Matching Matroids
uni/AA
Dec 06, 2025
Maximum Matching as LP
uni/AA
Dec 06, 2025
Linear Programming
uni/AA
Dec 06, 2025
Bases of a Matroid
uni/AA
Dec 06, 2025
Complementary Slackness
uni/AA
Dec 06, 2025
Tutte-Berge Formula
uni/AA
Dec 06, 2025
Blocking Flows
uni/AA
Dec 06, 2025
Bipartite matching via Alternating Paths
uni/AA
Dec 06, 2025
Advanced Algorithms UE 6
uni/AA
Dec 06, 2025
sum of completion times
uni/AA
Dec 06, 2025
Flow Optimality criteria
uni/AA
Dec 06, 2025
Matroids
uni/AA
Dec 06, 2025
Three field notation
uni/AA
Dec 06, 2025
Scheduling Problems
uni/AA
Dec 06, 2025
Circulation
uni/AA
Dec 06, 2025
LP Extreme points
uni/AA
Dec 06, 2025
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
Dec 06, 2025
Minimum-Cost Flow as LP
uni/AA
Dec 06, 2025
AA UE 1
uni/AA
Dec 06, 2025
Partition Matroids
uni/AA
Dec 06, 2025
LP Duality
uni/AA
Dec 06, 2025
Simplex method LP slover
uni/AA
Dec 06, 2025
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
Dec 06, 2025
Max-Height Algorithm
uni/AA
Dec 06, 2025
Stable marriage problem
uni/AA
Dec 06, 2025
Network Flows
uni/AA
Dec 06, 2025
Linear Equations
uni/AA
Dec 06, 2025
Reduktion Maximum Matching auf Max-Fluss Problem
uni/AA
Dec 06, 2025
Non-Bipartie Matching via M-Alternating Paths
uni/AA
Dec 06, 2025
Minimum-cost bipartite matching
uni/AA
Dec 06, 2025
Simple s-t-Networks
uni/AA
Dec 06, 2025
Strong Duality
uni/AA
Dec 06, 2025
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
Dec 06, 2025
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
Dec 06, 2025
Advanced Algorithms UE 10
uni/AA
Dec 06, 2025
symmetric Difference
uni/AA
Dec 06, 2025
Preemptive jobs
uni/AA
Dec 06, 2025
Advanced Algorithms UE 4
uni/AA
Dec 06, 2025
König’s Theorem
uni/AA
Dec 06, 2025
Maximum Matching
uni/AA
Dec 06, 2025
AA UE 0
uni/AA
Dec 06, 2025
Generic Cycle-Canceling Algorithm
uni/AA
Dec 06, 2025
Weighted Vertex Cover as LP
uni/AA
Dec 06, 2025
factor critical matching
uni/AA
Dec 06, 2025
LP Präsi
uni/AA
Dec 06, 2025
Graph as Totally Unimodular Matrix
uni/AA
Dec 06, 2025
Non-preemptive jobs
uni/AA
Dec 06, 2025
Edmonds and Karp Algoritums
uni/AA
Dec 06, 2025
Uniform Matroids
uni/AA
Dec 06, 2025
Modify Flowers
uni/AA
Dec 06, 2025
AA UE 9
uni/AA
Dec 06, 2025
LP Optimization = Separation
uni/AA
Dec 06, 2025
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
Dec 06, 2025
Advanced Algorithms Lernplan
uni/AA
Dec 06, 2025
Advanced Algorithms UE 1
uni/AA
Dec 06, 2025
Network with Cost
uni/AA
Dec 06, 2025
AA UE 10
uni/AA
Dec 06, 2025
Schrinking a blossom
uni/AA
Dec 06, 2025
AA UE 4
uni/AA
Dec 06, 2025
Matroid optimization
uni/AA
Dec 06, 2025
Convex set
uni/AA
Dec 06, 2025
Graph Flower
uni/AA
Dec 06, 2025
The Knapsack Problem as LP
uni/AA
Dec 06, 2025
Advanced Algorithms UE 2
uni/AA
Dec 06, 2025
Advanced Algorithms UE 9
uni/AA
Dec 06, 2025
Minmal Vertex Cover as LP
uni/AA
Dec 06, 2025
Unrelated Maschines
uni/AA
Dec 06, 2025
Preflows
uni/AA
Dec 06, 2025
Dinitz’ Algorithm
uni/AA
Dec 06, 2025
Minimum-Mean Cycle Algorithm
uni/AA
Dec 06, 2025
Min-Sum Scheduling
uni/AA
Dec 06, 2025
Advanced Algorithms MOC
map
uni/AA
Dec 06, 2025
Max-Flow Min-Cut Theorem
uni/AA
Dec 06, 2025
Min Cost Flow
uni/AA
Dec 06, 2025
Weighted Bipartite Matchings
uni/AA
Dec 06, 2025
Integer Linear Programs
uni/AA
Dec 06, 2025
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
Dec 06, 2025
Weak Duality
uni/AA
Dec 06, 2025
Satz von Berge
uni/AA
Dec 06, 2025
Minimal Spanning Tree
uni/AA
Dec 06, 2025
Stable Matchings
uni/AA
Dec 06, 2025
LP relaxations
uni/AA
Dec 06, 2025
Ellipsoid method LP slover
uni/AA
Dec 06, 2025
s-t-Cut
uni/AA
Dec 06, 2025
Flow Augmenting Paths
uni/AA
Dec 06, 2025
Totally Unimodular Matrices
uni/AA
Dec 06, 2025
Advanced Algorithms UE 7
uni/AA
Dec 06, 2025
LP solution space
uni/AA
Dec 06, 2025
extreme Matching
uni/AA
Dec 06, 2025
AA UE 5
uni/AA