Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Guohui Yao, Daming Zhu, Hengwu Li, Shaohan Ma. A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem. Discrete Mathematics, 308(17):3951-3959, 2008. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Approximation Algorithms for Directed Steiner ProblemsMoses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li. soda 1998: 192-200 Approximation Algorithms for Directed Steiner ProblemsMoses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li. jal, 33(1):73-91, 1999.
The following publications are possibly variants of this publication: