An Efficient Noisy Binary Search in Graphs via Median Approximation

Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski. An Efficient Noisy Binary Search in Graphs via Median Approximation. In Paola Flocchini, Lucia Moura, editors, Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings. Volume 12757 of Lecture Notes in Computer Science, pages 265-281, Springer, 2021. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.