๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new competitive algorithm for the counterfeit coin problem

โœ Scribed by X.D. Hu; P.D. Chen; F.K. Hwang

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
368 KB
Volume
51
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A (log23 + 12) competitive algorithm for
A (log23 + 12) competitive algorithm for the counterfeit coin problem
โœ Peng-Jun Wan; Ding-Zhu Du ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 912 KB

Consider a set of coins where each coin is either of the heavy type or the light type. The problem is to identify the type of each coin with minimal number of weighings on a balanced scale. The case that only one coin, called a counterfeit, has a different weight from others, is a classic mathematic

A 32log 3-competitive algorithm for the
A 32log 3-competitive algorithm for the counterfeit coin problem
โœ Peng-Jun Wan; Qifan Yang; Dean Kelley ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 524 KB

We study the following counterfeit coin problem: Suppose that there is a set of II coins. Each one is either heuuy or light. The goal is to sort them according to weight with a minimum number of weighings on a balance scale. Hu and Hwang gave an algorithm with a competitive ratio of 3 log 3 (all log

A new competitive algorithm for group te
A new competitive algorithm for group testing
โœ Amotz Bar-Noy; Frank K. Hwang; Ilan Kessler; Shay Kutten ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 582 KB