English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

O(log 2 k/ log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm

MPS-Authors
/persons/resource/persons180826

Laekhanukit,  Bundit
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Grandoni, F., Laekhanukit, B., & Li, S. (2019). O(log 2 k/ log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm. In STOC'19 (pp. 253-264). New York, NY: ACM. doi:10.1145/3313276.3316349.


Cite as: http://hdl.handle.net/21.11116/0000-0003-1625-B
Abstract
There is no abstract available