Approximation algorithm for minimum weight connected-\(k\)-subgraph cover

DOI10.1016/j.tcs.2020.05.043zbMath1453.68140MaRDI QIDQ2197543

Zhao Zhang, Pengcheng Liu, Xiao-hui Huang

Publication date: 1 September 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.05.043

zbMATH Keywords

approximation algorithm; girth; connected-\(k\)-subgraph cover

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

90C27: Combinatorial optimization

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms