"Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner ..."

Chun-Hsiang Chan et al. (2020)

> Home

Details and statistics

DOI: 10.4230/LIPICS.APPROX/RANDOM.2020.63

access: open

type: Conference or Workshop Paper

metadata version: 2021-09-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/approx/ChanLW020
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/ChanLW020
Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei, Yuhao Zhang:
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs. APPROX-RANDOM 2020: 63:1-63:20

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.