The update complexity of selection and related problems

DOI10.4230/LIPIcs.FSTTCS.2011.325zbMath1246.68115OpenAlexW2242792420MaRDI QIDQ2911635

Manoj Gupta, Yogish Sabharwal, Sandeep Sen

Publication date: 31 August 2012

Full work available at URL: https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2011.html#GuptaSS11

zbMATH Keywords

competitive analysisuncertain data

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of data (68P99)

Related Items (8)

Scheduling with testing on multiple identical parallel machines ⋮ Online makespan minimization with budgeted uncertainty ⋮ Randomization Helps Computing a Minimum Spanning Tree under Uncertainty ⋮ The update complexity of selection and related problems ⋮ Unnamed Item ⋮ Query-competitive algorithms for cheapest set problems under uncertainty ⋮ Algorithms for Queryable Uncertainty ⋮ Explorable uncertainty in scheduling with non-uniform testing times

This page was built for publication: The update complexity of selection and related problems