External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity

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]

Authors

Chao Liao

This author has not been identified. Look up 'Chao Liao' in Google

Qingyun Chen

This author has not been identified. Look up 'Qingyun Chen' in Google

Bundit Laekhanukit

This author has not been identified. Look up 'Bundit Laekhanukit' in Google

Yuhao Zhang 0001

This author has not been identified. Look up 'Yuhao Zhang 0001' in Google
runs on