scientific article; zbMATH DE number 7075885
From MaRDI portal
Publication:4967181
Recommendations
- Round-competitive algorithms for uncertainty problems with parallel queries
- Algorithms for queryable uncertainty
- Query-competitive sorting with uncertainty
- Query-Competitive Sorting with Uncertainty.
- Query-competitive algorithms for cheapest set problems under uncertainty
- Query-competitive algorithms for cheapest set problems under uncertainty
- Competitive randomized algorithms for nonuniform problems
- On the complexity of a class of combinatorial optimization problems with uncertainty
- scientific article; zbMATH DE number 622666
- Uncertain computation-based decision theory
Cited in
(25)- Computing and scheduling with explorable uncertainty
- Explorable uncertainty in scheduling with non-uniform testing times
- A robust optimization approach with probe-able uncertainty
- Query-competitive sorting with uncertainty
- Round-competitive algorithms for uncertainty problems with parallel queries
- Query-competitive algorithms for cheapest set problems under uncertainty
- Algorithms for queryable uncertainty
- Computing the Median with 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
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
- Minimizing query frequency to bound congestion potential for moving entities at a fixed target time
- A frequency-competitive query strategy for maintaining low collision potential among moving entities
- The power of amortization on scheduling with explorable uncertainty
- Competitive query minimization for stable matching with one-sided uncertainty
- Learning-augmented query policies for minimum spanning tree with uncertainty
- Round-competitive algorithms for uncertainty problems with parallel queries
- Frequency-competitive query strategies to maintain low congestion potential among moving entities
- Set selection with uncertain weights: non-adaptive queries and thresholds
- Algorithms that access the input via queries
- Scheduling with testing on multiple identical parallel machines
- Query-competitive algorithms for cheapest set problems under uncertainty
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967181)
