Affiliation:
1. Department of Computer Science and Engineering, Chalmers University, 41296 Göteborg, Sweden
Abstract
Suppose that some of the [Formula: see text] elements of a totally ordered structure is defective, and several repair robots are at our disposal. They can dock at a random element, move at unit speed or leave, and send each other signals if there is no defective between them. We show that, by using only two robots that obey simple rules, the defective can be localized in [Formula: see text] time, which is also optimal. A variation of our strategy needs three robots but has a more predictable behavior. The model is motivated by a conjectured DNA repair mechanism, and it combines group testing with geometric search.
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics