"$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner ..."

Fabrizio Grandoni, Bundit Laekhanukit, Shi Li (2019)

> Home

Details and statistics

DOI: 10.1137/20M1312988

access: closed

type: Journal Article

metadata version: 2025-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/0001L019
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/0001L019
Fabrizio Grandoni, Bundit Laekhanukit, Shi Li:
$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm. SIAM J. Comput. 52(on): STOC19-298-STOC19-322 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.