Polynomial-time algorithms for special cases of the maximum confluent flow problem.
Daniel DresslerMartin StrehlerPublished in: Discret. Appl. Math. (2014)
Keyphrases
- special case
- computational complexity
- orders of magnitude
- data structure
- learning algorithm
- image processing
- computationally expensive
- worst case
- computationally efficient
- scheduling problem
- min cost
- convergence rate
- times faster
- computational efficiency
- benchmark datasets
- data sets
- computational cost
- np hard
- significant improvement
- machine learning