Cooperation in combinatorial search

DOI10.1007/S11590-024-02120-1MaRDI QIDQ6968763zbMATH OpenFDO

Authors Dániel Gerbner, Balázs Keszegh, Balázs Patkós, Gábor Wiener

Publication date 24 June 2025

Published in Optimization Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11590-024-02120-1

zbMATH Keywords

combinatorial searchcooperative searchsearch game

Mathematics Subject Classification ID

Set theory (03Exx) Graph theory (05Cxx) Series expansions of functions of one complex variable (30Bxx)

Cites work

• Ein Satz über Untermengen einer endlichen Menge.
• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• scientific article; zbMATH DE number 1134636 (Why is no real title available?)
• Minimal completely separating systems
• On a lemma of Littlewood and Offord
• On separating systems of a finite set
• Searching games with errors -- fifty years of coping with liars
• Separating path systems of almost linear size
• Separating the edges of a graph by a linear number of paths
• Three Thresholds for a Liar

This page was built for publication: Cooperation in combinatorial search

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