New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness.
Krzysztof FleszarMatthias MnichJoachim SpoerhasePublished in: ESA (2016)
Keyphrases
- learning algorithm
- optimization problems
- graph theory
- bayesian networks
- neural network
- data structure
- computational complexity
- orders of magnitude
- disjoint paths
- minimum spanning tree
- indexing structure
- suffix tree
- r tree
- machine learning algorithms
- computational cost
- special case
- significant improvement
- data streams
- objective function