Approximation to the Minimum Rooted Star Cover Problem

DOI10.1007/978-3-540-72504-6_61MaRDI QIDQ5425480zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Approximating the minmax rooted-tree cover in a tree
• Min-max tree covers of graphs.
• Approximation hardness of min-max tree covers
• Minimum constellation covers: hardness, approximability and polynomial cases

Cited in

(5)

• scientific article; zbMATH DE number 892042 (Why is no real title available?)
• New approximation algorithms for the rooted budgeted cycle cover problem
• New approximation algorithms for the rooted budgeted cycle cover problem
• scientific article; zbMATH DE number 7758359 (Why is no real title available?)
• The two-squirrel problem and its relatives

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

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