Login / Signup
Lower Bounds for Protrusion Replacement by Counting Equivalence Classes.
Bart M. P. Jansen
Jules J. H. M. Wulms
Published in:
CoRR (2016)
Keyphrases
</>
equivalence classes
lower bound
equivalence class
upper bound
branch and bound
objective function
bayesian network structures
branch and bound algorithm
np hard
directed acyclic graph
optimal solution
lower and upper bounds
replacement policy
worst case