BibTeX record conf/approx/ChanLW020

download as .bib file

@inproceedings{DBLP:conf/approx/ChanLW020,
  author       = {Chun{-}Hsiang Chan and
                  Bundit Laekhanukit and
                  Hao{-}Ting Wei and
                  Yuhao Zhang},
  editor       = {Jaroslaw Byrka and
                  Raghu Meka},
  title        = {Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner
                  Tree on Quasi-Bipartite Graphs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
                  Conference},
  series       = {LIPIcs},
  volume       = {176},
  pages        = {63:1--63:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.63},
  doi          = {10.4230/LIPICS.APPROX/RANDOM.2020.63},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/ChanLW020.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.