HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information

# On the Power of Additive Combinatorial Search Model

1 POLKA - Polynomials, Combinatorics, Arithmetic
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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 proven for the class of $k$--degenerate graphs.
Keywords :
Document type :
Conference papers
Domain :

https://hal.inria.fr/inria-00098615
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Monday, September 25, 2006 - 5:03:57 PM
Last modification on : Friday, February 4, 2022 - 3:31:10 AM

### Identifiers

• HAL Id : inria-00098615, version 1

### Citation

Vladimir Grebinski. On the Power of Additive Combinatorial Search Model. Fourth Annual International Computing and Combinatorics Conference - COCOON'98, 1998, Taipei/Taiwan, pp.194-203. ⟨inria-00098615⟩

Record views