BibTeX record conf/icalp/LiaoCL022

download as .bib file

@inproceedings{DBLP:conf/icalp/LiaoCL022,
  author       = {Chao Liao and
                  Qingyun Chen and
                  Bundit Laekhanukit and
                  Yuhao Zhang},
  editor       = {Mikolaj Bojanczyk and
                  Emanuela Merelli and
                  David P. Woodruff},
  title        = {Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity},
  booktitle    = {49th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2022, July 4-8, 2022, Paris, France},
  series       = {LIPIcs},
  volume       = {229},
  pages        = {89:1--89:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2022.89},
  doi          = {10.4230/LIPICS.ICALP.2022.89},
  timestamp    = {Tue, 28 Jun 2022 17:14:58 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/LiaoCL022.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.