The power of amortization on scheduling with explorable uncertainty

DOI10.1007/978-3-031-49815-2_7MaRDI QIDQ6574932FDOQ6574932

Authors: Hsiang-Hsuan Liu, Fu-Hong Liu, Prudence W. H. Wong, Xiao-Ou Zhang 

Publication date: 19 July 2024

zbMATH Keywords

competitive analysistotal completion timeamortized analysisexplorable uncertaintyonline scheduling algorithms

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Approximation algorithms (68W25)

Cites Work

• The update complexity of selection and related problems
• Computing minimum spanning trees with uncertainty
• Optimal Search for the Best Alternative
• Computing shortest paths with uncertainty
• Explorable uncertainty in scheduling with non-uniform testing times
• An adversarial model for scheduling with testing
• Query-competitive sorting with uncertainty
• Computing the median with uncertainty
• Title not available (Why is that?)
• Scheduling with explorable uncertainty
• Query-competitive algorithms for cheapest set problems under uncertainty
• Competitive information design for Pandora's Box

This page was built for publication: The power of amortization on scheduling with explorable uncertainty

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