An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs

DOI10.1007/978-3-642-17461-2_13zbMath1310.68241OpenAlexW1599028340MaRDI QIDQ3066453

Hongyu Liang, Jing (Selena) He

Publication date: 10 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_13

zbMATH Keywords

approximation algorithmdense graphsspanning star forest

Mathematics Subject Classification ID

Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

On Variants of the Spanning Star Forest Problem ⋮ APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM

This page was built for publication: An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs