A strongly polynomial time algorithm for the maximum supply rate problem on trees.
Koki TakayamaYusuke KobayashiPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- computational complexity
- learning algorithm
- worst case
- detection algorithm
- cost function
- improved algorithm
- experimental evaluation
- k means
- recognition algorithm
- matching algorithm
- tree structure
- segmentation algorithm
- preprocessing
- special case
- np hard
- times faster
- probabilistic model
- high accuracy
- approximation ratio
- linear programming
- simulated annealing
- computational cost
- dynamic programming
- data structure
- objective function