Finding defectives on a line by random docking and interval group tests

DOI10.1142/S179383091750029XzbMATH Open1418.68219OpenAlexW2590627861MaRDI QIDQ5367521FDOQ5367521

Peter Damaschke

Publication date: 20 October 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179383091750029x

zbMATH Keywords

interval group testingcooperative robotscow path problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Cites Work

• Title not available (Why is that?)
• Searching in the plane
• Computational Science – ICCS 2005
• Overlaps help: Improved bounds for group testing with interval queries
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• 2-Stage Fault Tolerant Interval Group Testing

Cited In (1)

• An efficient randomized group testing procedure to determine the number of defectives

This page was built for publication: Finding defectives on a line by random docking and interval group tests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367521)