Rounds in combinatorial search

DOI10.1007/S00453-013-9750-YMaRDI QIDQ378259zbMATH OpenOpenAlexFDO

Authors 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/

zbMATH Keywords

searchgroup testingadaptivityrounds

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• scientific article; zbMATH DE number 1508646 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Another algebraic proof of Bondy's theorem on induced subsets
• Edge Multiplicity and Other Trace Functions
• Induced subsets
• Long paths and cycles in hypercubes with faulty vertices
• Long paths in hypercubes with a quadratic number of faults
• Minimal completely separating systems
• On the density of sets of vectors
• On the trace of finite sets

Cited in

(7)

• Recognition problems and communication complexity.
• Deterministic versus randomized adaptive test cover
• Edge Multiplicity and Other Trace Functions
• Separating families of convex sets
• Rounds in a combinatorial search problem
• Randomized adaptive test cover
• 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)