Algorithms that access the input via queries

DOI10.1007/978-3-030-67731-2_1zbMath1490.68293OpenAlexW3124806964MaRDI QIDQ831777

Erlebach, Thomas

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_1

zbMATH Keywords

explorable uncertaintyquery-competitive algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) General topics in the theory of algorithms (68W01)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization
• An adaptivity hierarchy theorem for property testing
• Economic efficiency requires interaction
• Query-competitive sorting with uncertainty
• The Covert Set-Cover Problem with Application to Network Discovery
• Graph Reconstruction and Verification
• A Survey on Direct Search Methods for Blackbox Optimization and Their Applications
• Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
• Introduction to Property Testing
• New Query Lower Bounds for Submodular Function Minimization
• Edge Estimation with Independent Set Oracles

This page was built for publication: Algorithms that access the input via queries