Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs

Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Dirk Oliver Theis. Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs. Theoretical Computer Science, 775:1-15, 2019. [doi]

Abstract

Abstract is missing.