Algorithms that access the input via queries

DOI10.1007/978-3-030-67731-2_1zbMATH Open1490.68293OpenAlexW3124806964MaRDI QIDQ831777FDOQ831777

Authors: Thomas Erlebach 

Publication date: 24 March 2022

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

Recommendations

• scientific article; zbMATH DE number 7075885
• Computing and scheduling with explorable uncertainty
• Algorithms for queryable uncertainty
• Round-competitive algorithms for uncertainty problems with parallel queries
• Query strategies for priced information (extended abstract)

zbMATH Keywords

explorable uncertaintyquery-competitive algorithm

Mathematics Subject Classification ID

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

Cites Work

• Geometric algorithms and combinatorial optimization
• Computing minimum spanning trees with uncertainty
• Edge Estimation with Independent Set Oracles
• A survey on direct search methods for blackbox optimization and their applications
• Introduction to Property Testing
• The covert set-cover problem with application to network discovery
• Optimally reconstructing weighted graphs using queries
• Computing exact minimum cuts without knowing the graph
• An adaptivity hierarchy theorem for property testing
• Economic efficiency requires interaction
• Query-competitive sorting with uncertainty
• Graph reconstruction and verification
• Title not available (Why is that?)
• Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
• New Query Lower Bounds for Submodular Function Minimization

Cited In (1)

• Computing and scheduling with explorable uncertainty

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

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