Query-Competitive Sorting with Uncertainty.
From MaRDI portal
Recommendations
- Query-competitive sorting with uncertainty
- scientific article; zbMATH DE number 7075885
- Query-competitive algorithms for cheapest set problems under uncertainty
- Query-competitive algorithms for cheapest set problems under uncertainty
- Competitive randomized algorithms for nonuniform problems
- Sorting and Selection with Random Costs
- Round-competitive algorithms for uncertainty problems with parallel queries
- Optimal sorting with persistent comparison errors
Cites work
- A Mathematical Theory of Communication
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Computing minimum spanning trees with uncertainty
- Computing shortest paths with uncertainty
- Computing the Median with Uncertainty
- Efficient update strategies for geometric computing with uncertainty
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 7075885 (Why is no real title available?)
- Information collection for linear programs with uncertain objective coefficients
- Introduction to stochastic programming.
- Minimum spanning tree under explorable uncertainty in theory and experiments
- Query-competitive algorithms for cheapest set problems under uncertainty
- Quicksort
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
- Robust optimization - a comprehensive survey
- Scheduling with explorable uncertainty
- Stochastic packing integer programs with few queries
- The robust knapsack problem with queries
- The update complexity of selection and related problems
- Threshold tolerance graphs
- Verification problem of maximal points under uncertainty
Cited in
(10)- Query-competitive sorting with uncertainty
- Round-competitive algorithms for uncertainty problems with parallel queries
- scientific article; zbMATH DE number 7075885 (Why is no real title available?)
- Query minimization under stochastic uncertainty
- Query minimization under stochastic uncertainty
- Set selection under explorable stochastic uncertainty via covering techniques
- Sorting under partial (interval order) information
- Competitive query minimization for stable matching with one-sided uncertainty
- Round-competitive algorithms for uncertainty problems with parallel queries
- On the complexity of knapsack under explorable uncertainty: hardness and algorithms
This page was built for publication: Query-Competitive Sorting with Uncertainty.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092365)
