Login / Signup
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs.
Chun-Hsiang Chan
Bundit Laekhanukit
Hao-Ting Wei
Yuhao Zhang
Published in:
APPROX-RANDOM (2020)
Keyphrases
</>
bipartite graph
optimal solution
np hard
computational complexity
dynamic programming
convex hull
lower and upper bounds
maximum matching
reinforcement learning
collaborative filtering
markov chain
knapsack problem
minimum spanning tree