On the power of additive combinatorial search model

Abstract

We consider two generic problems of combinatorial search under the additive model. The first one is the problem of reconstructing bounded–weight vectors. We establish an optimal upper bound and observe that it unifies many known results for coin–weighing problems. The developed technique provides a basis for the graph reconstruction problem. Optimal upper bound is proved for the class of k–degenerate graphs.