Erratum
From MaRDI portal
Publication:4554365
DOI10.1145/3186991zbMath1454.68186OpenAlexW4254450489MaRDI QIDQ4554365
Publication date: 13 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3186991
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Connectivity (05C40)
Related Items (3)
Hardness of minimum barrier shrinkage and minimum installation path ⋮ Approximating k-Connected m-Dominating Sets ⋮ Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
This page was built for publication: Erratum
