Simple on-line algorithms for the maximum disjoint paths problem.
Petr KolmanChristian ScheidelerPublished in: SPAA (2001)
Keyphrases
- black box
- computationally efficient
- neural network
- disjoint paths
- data structure
- theoretical analysis
- computational efficiency
- learning algorithm
- computational cost
- computationally expensive
- data sets
- computational complexity
- image processing
- machine learning algorithms
- benchmark datasets
- orders of magnitude
- recently developed
- approximation algorithms