Lower and upper bounds on obtaining history independence.

Niv Buchbinder Erez Petrank

Published in: Inf. Comput. (2006)

Keyphrases

lower and upper bounds
lower bound
upper bound
upper and lower bounds
lower bounding
lagrangian relaxation
valid inequalities
itemsets
dynamic programming
data sets
data structure
search algorithm
special case
np hard
conditional independence