An Efficient Noisy Binary Search in Graphs via Median Approximation.

Dariusz Dereniowski Aleksander Lukasiewicz Przemyslaw Uznanski

Published in: CoRR (2020)

Keyphrases

binary search
graph theory
noisy environments
graph representation
approximation algorithms
graph model
approximation error
graph theoretic
closed form
bipartite graph
data sets
noisy data
pattern recognition
noise free
bayesian networks
graph construction
approximation guarantees
genetic algorithm