Faster exact O((2+ε)^n) algorithm and polynomial-time k- and 2-approximations for bounded in-degree polytree learning, with nearly tight lower bounds.
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
-
Exact and Approximate Algorithms for Polytree Learning
Faster exact O((2+ε)^n) algorithm and polynomial-time k- and 2-approximations for bounded in-degree polytree learning, with nearly tight lower bounds.