Round-competitive algorithms for uncertainty problems with parallel queries
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 7075885 (Why is no real title available?)
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- An adaptivity hierarchy theorem for property testing
- An adversarial model for scheduling with testing
- Computing minimum spanning trees with uncertainty
- Computing shortest paths with uncertainty
- Computing the Median with Uncertainty
- Efficient update strategies for geometric computing with uncertainty
- Information collection for linear programs with uncertain objective coefficients
- Minimum spanning tree under explorable uncertainty in theory and experiments
- Minimum spanning tree verification under uncertainty
- Preprocessing Ambiguous Imprecise Points
- Query-Competitive Sorting with Uncertainty.
- Query-competitive algorithms for cheapest set problems under uncertainty
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
- Representation of a finite graph by a set of intervals on the real line
- Sorting and selection with imprecise comparisons
- Stochastic packing integer programs with few queries
- The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
- The robust knapsack problem with queries
- The update complexity of selection and related problems
- Verification problem of maximal points under uncertainty
This page was built for publication: Round-competitive algorithms for uncertainty problems with parallel queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231550)
