An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths.
Zeev NutovPublished in: CiE (2023)
Keyphrases
- worst case
- detection algorithm
- preprocessing
- theoretical analysis
- dynamic programming
- spanning tree
- error bounds
- high accuracy
- computational complexity
- approximation ratio
- learning algorithm
- recognition algorithm
- search space
- optimal solution
- experimental evaluation
- optimization algorithm
- constant factor
- computational cost
- times faster
- tree structure
- significant improvement
- similarity measure
- simulated annealing
- neural network
- np hard
- cost function
- k means
- approximation algorithms
- lower bound
- data structure
- optimal path
- objective function
- square error