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:
CoRR (2019)
Keyphrases
</>
np hard
computational complexity
bipartite graph
steiner tree
maximum matching
learning algorithm
dynamic programming
worst case
optimal solution
search algorithm
mathematical model
combinatorial optimization
minimum spanning tree