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]
@article{KhoshkhahGMT19, title = {Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs}, author = {Kaveh Khoshkhah and Mehdi Khosravian Ghadikolaei and Jérôme Monnot and Dirk Oliver Theis}, year = {2019}, doi = {10.1016/j.tcs.2018.11.025}, url = {https://doi.org/10.1016/j.tcs.2018.11.025}, researchr = {https://researchr.org/publication/KhoshkhahGMT19}, cites = {0}, citedby = {0}, journal = {Theoretical Computer Science}, volume = {775}, pages = {1-15}, }