Computing the Median with Uncertainty
From MaRDI portal
Recommendations
Cited in
(26)- Explorable uncertainty in scheduling with non-uniform testing times
- An adversarial model for scheduling with testing
- A robust optimization approach with probe-able uncertainty
- Optimal path discovery problem with homogeneous knowledge
- Query-competitive sorting with uncertainty
- Round-competitive algorithms for uncertainty problems with parallel queries
- The update complexity of selection and related problems
- The update complexity of selection and related problems
- Computing the median with uncertainty
- The robust knapsack problem with queries
- Randomization helps computing a minimum spanning tree under uncertainty
- Algorithms for queryable uncertainty
- scientific article; zbMATH DE number 1419406 (Why is no real title available?)
- Scheduling with explorable uncertainty
- The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
- Query-Competitive Sorting with Uncertainty.
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
- Query minimization under stochastic uncertainty
- Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
- Set selection under explorable stochastic uncertainty via covering techniques
- Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time
- Learning-augmented query policies for minimum spanning tree with uncertainty
- Round-competitive algorithms for uncertainty problems with parallel queries
- On the complexity of knapsack under explorable uncertainty: hardness and algorithms
- Scheduling with testing on multiple identical parallel machines
- Query-competitive algorithms for cheapest set problems under uncertainty
This page was built for publication: Computing the Median with Uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4706217)
