Almost tight approximation hardness for single-source directed \(k\)-edge-connectivity

DOI10.4230/LIPICS.ICALP.2022.89MaRDI QIDQ6560887

B. Laekhanukit, Yu-Hao Zhang, Chao Liao, Qingyun Chen

Publication date: 24 June 2024

zbMATH Keywords

hardness of approximationdirected Steiner treefault-tolerant and survivable network design

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

This page was built for publication: Almost tight approximation hardness for single-source directed \(k\)-edge-connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560887)