Lower bounds for protrusion replacement by counting equivalence classes.
Bart M. P. JansenJules J. H. M. WulmsPublished in: Discret. Appl. Math. (2020)
Keyphrases
- equivalence classes
- lower bound
- equivalence class
- upper bound
- branch and bound algorithm
- branch and bound
- np hard
- worst case
- objective function
- bayesian network structures
- lower and upper bounds
- optimal solution
- directed acyclic graph
- vc dimension
- online algorithms
- data analysis
- data structure
- conditional independencies