Approximation to the Minimum Rooted Star Cover Problem

DOI10.1007/978-3-540-72504-6_61zbMath1200.68286OpenAlexW1621012923MaRDI QIDQ5425480

Wen-Bo Zhao, Peng Zhang

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_61

zbMATH Keywords

Approximation AlgorithmMinimum Rooted Star Cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

New approximation algorithms for the rooted budgeted cycle cover problem ⋮ New approximation algorithms for the rooted budgeted cycle cover problem

This page was built for publication: Approximation to the Minimum Rooted Star Cover Problem