Finding disjoint paths with different path-costs: Complexity and algorithms.
Chung-Lun LiS. Thomas McCormickDavid Simchi-LeviPublished in: Networks (1992)
Keyphrases
- computational complexity
- computational cost
- worst case
- lower complexity
- times faster
- computationally efficient
- np complete
- disjoint paths
- computationally complex
- high computational complexity
- space complexity
- orders of magnitude
- optimization problems
- data structure
- data sets
- machine learning algorithms
- dynamic programming
- significant improvement
- complexity analysis
- association rules
- social networks
- polynomial time complexity
- learning algorithm