On the Power of Additive Combinatorial Search Model
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.
Unable to display preview. Download preview PDF.
- Martin Aigner. Combinatorial Search. John Wiley & Sons, 1988.Google Scholar
- Noga Alon. Separating matrices. private communication, May 1997.Google Scholar
- Noga Alon and Joel Spencer. The Probabilistic Method. John Wiley & Sons, 1992.Google Scholar
- Béla Bollobás. Extremal Graph Theory. Academic Press, 1978.Google Scholar
- Ding-Zhu Du and Frank K. Hwang. Combinatorial Group Testing and its applications, volume 3 of Series on applied mathematics. World Scientific, 1993.Google Scholar
- Paul Erdős and Joel Spencer. Probabilistic Methods in Combinatorics. 1974.Google Scholar
- Vladimir Grebinski and Gregory Kucherov. Optimal query bounds for reconstructing a hamiltonian cycle in complete graphs. In Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems, pages 166–173. IEEE Press, 1997.Google Scholar
- Vladimir Grebinski and Gregory Kucherov. Optimal reconstruction of graphs under the additive model. In Rainer Burkard and Gerhard Woeginger, editors, Algorithms — ESA’97, volume 1284 of LNCS, pages 246–258. Springer, 1997.Google Scholar
- Bernt Lindström. Determining subsets by unramified experiments. In J.N. Srivastava, editor, A Survey of Statistical Designs and Linear Models, pages 407–418. North Holland, Amsterdam, 1975.Google Scholar