Login / Signup
k/log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm.
Fabrizio Grandoni
Bundit Laekhanukit
Shi Li
Published in:
CoRR (2018)
Keyphrases
</>
learning algorithm
computational complexity
worst case
dynamic programming
optimal solution
search space
np hard
knapsack problem