On the Power of Additive Combinatorial Search Model - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

On the Power of Additive Combinatorial Search Model

Vladimir Grebinski
  • Function : Author
  • PersonId : 755985
  • IdRef : 193209039

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.
No file

Dates and versions

inria-00098615 , version 1 (25-09-2006)

Identifiers

  • HAL Id : inria-00098615 , version 1

Cite

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⟩
34 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More