scientific article; zbMATH DE number 7204536

DOI10.4230/LIPIcs.ICALP.2017.84zbMath1441.68289arXiv1702.08207MaRDI QIDQ5111415

Dariusz Dereniowski, Adrian Kosowski, Przemysław Uznański, Mengchuan Zou

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1702.08207

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmadaptive algorithmtreesvertex rankinggraph searchbinary search

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation algorithms (68W25)

Related Items (6)

Theoretical analysis of git bisect ⋮ Edge and pair queries-random graphs and complexity ⋮ Binary search in graphs revisited ⋮ The complexity of bicriteria tree-depth ⋮ The complexity of bicriteria tree-depth ⋮ An efficient noisy binary search in graphs via Median approximation

This page was built for publication: