Lower Bounds for Protrusion Replacement by Counting Equivalence Classes.
Bart M. P. JansenJules J. H. M. WulmsPublished in: IPEC (2016)
Keyphrases
- equivalence classes
- lower bound
- equivalence class
- upper bound
- branch and bound algorithm
- branch and bound
- bayesian network structures
- directed acyclic graph
- lower and upper bounds
- np hard
- objective function
- optimal solution
- worst case
- vc dimension
- conditional independencies
- data structure
- error bounds
- replacement policy
- bayesian networks