A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees.
Koki TakayamaYusuke KobayashiPublished in: FAW (2018)
Keyphrases
- worst case
- experimental evaluation
- detection algorithm
- computational complexity
- computational cost
- learning algorithm
- improved algorithm
- optimization algorithm
- preprocessing
- particle swarm optimization
- special case
- decision trees
- tree structure
- matching algorithm
- times faster
- optimal solution
- genetic algorithm
- probabilistic model
- high accuracy
- dynamic programming
- significant improvement
- input data
- cost function
- theoretical analysis
- objective function
- ant colony optimization
- strongly polynomial
- segmentation algorithm
- linear programming
- simulated annealing
- markov random field
- search space
- np hard