An improved lower bound for (1,<=2)-identifying codes in the king grid

Florent Foucaud Tero Laihonen Aline Parreau

Published in: CoRR (2011)

Keyphrases

lower bound
upper bound
optimal solution
branch and bound
objective function
branch and bound algorithm
np hard
lower and upper bounds
error correction
worst case
grid computing
upper and lower bounds
grid points
data sets
lagrangian relaxation
binary codes
grid enabled
polynomial approximation