FPT algorithms solve two budgeted PD variants on networks in O*(2^nsw B^2) time and compute PD scores for the third in O*(3^nsw) time, plus exact nsw computation via DP and ILP.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth
FPT algorithms solve two budgeted PD variants on networks in O*(2^nsw B^2) time and compute PD scores for the third in O*(3^nsw) time, plus exact nsw computation via DP and ILP.