PDF 6-7-8 Network-flow Flashcards
(29 cards)
1
Q
What’s a network
A
2
Q
What constraints a feasible flow need to satisfy?
A
3
Q
What is the value of the flow?
A
4
Q
When an arc is saturated?
A
5
Q
What is a maximum flow problem?
A
6
Q
Linear Programming model for max-flow problem
A
7
Q
What’s a cut separating s from t?
A
8
Q
Capacity of the cut?
A
9
Q
Value of the flow
A
10
Q
Property one
A
11
Q
Property two + proof (weak duality)
A
12
Q
Dual problem
A
13
Q
Ford fulkerson
A
14
Q
Proof of exactness
A
15
Q
Theorem of strong dduality
A
16
Q
Size of an istance
A
17
Q
Ford Fulkerson complexity
A
18
Q
WHy ford fulkerson may be inefficient
A
19
Q
Name of faster implementation for max-flow problem
A
20
Q
What’s a recognition problem
A
21
Q
What a P class is?
A
22
Q
What an NP-class is?
A
23
Q
What reduce in polynomial time mean?
A
24
Q
What’s a polinomial time transformation?
A
25
NP-complete class
26
NP-hard problem
27
ILP is NP-Hard proof
28
Traveling salesman problem formulation
29
WHat’s an hamiltonian circuit
