On the power of additive combinatorial search model (1998) [2 citations — 1 self]
Download:
|
|
by Vladimir Grebinski
in Proceedings of the 4th Annual International Computing and Combinatorics Conference, Lecture Notes in Comput. Sci. 1449
http://www.loria.fr/~grebinsk/publications/cocoon98.ps.gz
Add To MetaCart
Abstract:
We consider two generic problems of combinatorial search under the additive model. The ��rst one is the problem of reconstructing boundedweight vectors. We establish an optimal upper bound and observe that it uni��es many known results for coinweighing problems. The developed technique provides a basis for the graph reconstruction problem. Optimal upper bound is proven for the class of kdegenerate graphs. 1
Citations
| 1400 | The Probabilistic Method – Alon, Spencer - 1992 |
| 71 | Combinatorics of Finite Sets – Anderson - 1987 |
| 22 | Combinatorial Group Testing and Its Applications – Du, Hwang - 1993 |
| 13 | Extremal Graph Theory – Bollobs - 1978 |
| 8 | Optimal query bounds for reconstructing a hamiltonian cycle in complete graphs – Grebinski, Kucherov - 1997 |
| 8 | Optimal reconstruction of graphs under the additive model – Grebinski, Kucherov - 2000 |
| 3 | Separating matrices. private communication – Alon - 1997 |
| 2 | A generalized model for understanding evasiveness – Aggarwal, Coppersmith, et al. - 1989 |
| 2 | On M#bius functions and a problem in combinatorial number theory – Lindstrm - 1971 |
| 2 | Determining subsets by unramied experiments – Lindstrm - 1975 |
