2019 Help me understand this report
A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem
Search citation statements
Paper Sections
Select...
1
Citation Types
0
1
0
Year Published
2022
2022
Publication Types
Select...
1
Relationship
0
1
Authors
Journals
Cited by 1 publication
(1 citation statement)
References 14 publications
0
1
0
“…An application to computational biology is presented in [23]. Some important results on polynomial time approximation schemes for these problems are in [23,24]. Compared to these problems, the output of SpHRP has a fixed architecture.…”
Section: Star P-hub Routing Cost Problemmentioning
confidence: 99%
“…An application to computational biology is presented in [23]. Some important results on polynomial time approximation schemes for these problems are in [23,24]. Compared to these problems, the output of SpHRP has a fixed architecture.…”
Section: Star P-hub Routing Cost Problemmentioning
confidence: 99%
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
