Rounds in combinatorial search

DOI10.1007/S00453-013-9750-YzbMATH Open1275.68109OpenAlexW2051532473MaRDI QIDQ378259FDOQ378259

Gábor Wiener

Publication date: 11 November 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2239/

Recommendations

• Rounds in a combinatorial search problem
• Combinatorial search in two and more rounds
• On separating systems with bounded set size
• Ratewise-optimal non-sequential search strategies under constraints on the tests
• Two applications of separating systems to nonadaptive procedures

zbMATH Keywords

searchgroup testingadaptivityrounds

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Hypergraphs (05C65)

Cites Work

• Induced subsets
• On the density of sets of vectors
• On the trace of finite sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Another algebraic proof of Bondy's theorem on induced subsets
• Edge Multiplicity and Other Trace Functions
• Minimal completely separating systems
• Long paths and cycles in hypercubes with faulty vertices
• Long paths in hypercubes with a quadratic number of faults

Cited In (7)

• Randomized Adaptive Test Cover
• Recognition problems and communication complexity.
• Edge Multiplicity and Other Trace Functions
• Deterministic versus randomized adaptive test cover
• Separating families of convex sets
• Rounds in a combinatorial search problem
• Combinatorial search in two and more rounds

This page was built for publication: Rounds in combinatorial search

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