On the Power of Additive Combinatorial Search Model

Vladimir Grebinski 1
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.
Type de document :
Communication dans un congrès
W.-L. Hsu, M.-Y. Kao. Fourth Annual International Computing and Combinatorics Conference - COCOON'98, 1998, Taipei/Taiwan, Springer, 1449, pp.194-203, 1998, Lecture Note in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/inria-00098615
Contributeur : Publications Loria <>
Soumis le : lundi 25 septembre 2006 - 17:03:57
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00098615, version 1

Collections

Citation

Vladimir Grebinski. On the Power of Additive Combinatorial Search Model. W.-L. Hsu, M.-Y. Kao. Fourth Annual International Computing and Combinatorics Conference - COCOON'98, 1998, Taipei/Taiwan, Springer, 1449, pp.194-203, 1998, Lecture Note in Computer Science. 〈inria-00098615〉

Partager

Métriques

Consultations de la notice

40