A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks.
S. M. Sadegh Tabatabaei YazdiSerap A. SavariPublished in: IEEE Trans. Inf. Theory (2011)
Keyphrases
- objective function
- optimal solution
- search space
- matching algorithm
- simulated annealing
- cost function
- np hard
- dynamic programming
- image processing
- worst case
- similarity measure
- computer vision
- probabilistic model
- linear programming
- segmentation algorithm
- shortest path
- clustering method
- metaheuristic
- convergence rate
- max flow min cut