Chao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang 0001. Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity. In Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff, editors, 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France. Volume 229 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]
@inproceedings{LiaoCL022,
title = {Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity},
author = {Chao Liao and Qingyun Chen and Bundit Laekhanukit and Yuhao Zhang 0001},
year = {2022},
doi = {10.4230/LIPIcs.ICALP.2022.89},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.89},
researchr = {https://researchr.org/publication/LiaoCL022},
cites = {0},
citedby = {0},
booktitle = {49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France},
editor = {Mikolaj Bojanczyk and Emanuela Merelli and David P. Woodruff},
volume = {229},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-235-8},
}