32 search results - page 7 / 7 » approx 2005 |
130
click to vote
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
149
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...