)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm.
Fabrizio GrandoniBundit LaekhanukitShi LiPublished in: STOC (2019)
Keyphrases
- dynamic programming
- learning algorithm
- cost function
- worst case
- computational complexity
- search space
- probabilistic model
- objective function
- minimum spanning tree
- simulated annealing
- np hard
- optimal solution
- search algorithm
- linear programming
- particle swarm optimization
- tree structure
- multistage
- convex hull
- approximation ratio