Learning-augmented query policies for minimum spanning tree with uncertainty
From MaRDI portal
Cites work
- An adversarial model for scheduling with testing
- Competitive Caching with Machine Learned Advice
- Computing exact minimum cuts without knowing the graph
- Computing minimum spanning trees with uncertainty
- Computing shortest paths with uncertainty
- Computing the Median with Uncertainty
- Edge Estimation with Independent Set Oracles
- Efficient update strategies for geometric computing with uncertainty
- Explorable uncertainty in scheduling with non-uniform testing times
- Flow time scheduling with uncertain processing time
- Graph connectivity and single element recovery via linear and OR queries
- scientific article; zbMATH DE number 3957111 (Why is no real title available?)
- scientific article; zbMATH DE number 7075885 (Why is no real title available?)
- scientific article; zbMATH DE number 7650400 (Why is no real title available?)
- scientific article; zbMATH DE number 7758362 (Why is no real title available?)
- scientific article; zbMATH DE number 7740865 (Why is no real title available?)
- scientific article; zbMATH DE number 7829331 (Why is no real title available?)
- scientific article; zbMATH DE number 7788374 (Why is no real title available?)
- Introduction to Property Testing
- Learning-augmented query policies for minimum spanning tree with uncertainty
- Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
- Minimum spanning tree verification under uncertainty
- Multi-armed bandit allocation indices. With a foreword by Peter Whittle.
- Near-Optimal Bounds for Online Caching with Machine Learned Advice
- On the likelihood that one unkrown probability exeeds another in view of the evidence of two samples.
- Online Scheduling via Learned Weights
- Optimal Search for the Best Alternative
- Optimally reconstructing weighted graphs using queries
- Query minimization under stochastic uncertainty
- Query-competitive algorithms for cheapest set problems under uncertainty
- Query-competitive sorting with uncertainty
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Scheduling with Predictions and the Price of Misprediction
- Scheduling with testing on multiple identical parallel machines
- Semi-online bipartite matching
- Stochastic packing integer programs with few queries
- The Markovian price of information
- The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
- The price of information in combinatorial optimization
- The robust knapsack problem with queries
- The update complexity of selection and related problems
Cited in
(3)
This page was built for publication: Learning-augmented query policies for minimum spanning tree with uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969633)
