Fast Augmentation Algorithms for Maximising the Flow in Repairable Flow Networks After a Component Failure.
Michael T. TodinovPublished in: CIT (2011)
Keyphrases
- computational complexity
- network structure
- min cost
- flow patterns
- learning algorithm
- significant improvement
- worst case
- flow estimation
- orders of magnitude
- social networks
- computationally efficient
- theoretical analysis
- optimization problems
- computational efficiency
- association rules
- flow field
- discrete event
- max flow
- data structure
- data mining