AI Assistant
Blog
Pricing
Log In
Sign Up
$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
Details
Cite
Export
Add to List
The content you want is available to Zendy users.
Already have an account? Click
here.
to sign in.
