Competitive online approximation of the optimal search ratio
From MaRDI portal
Recommendations
- Competitive Online Approximation of the Optimal Search Ratio
- Optimal online \(k\)-min search
- A new approach to online scheduling: approximating the optimal competitive ratio
- A new approach to online scheduling: approximating the optimal competitive ratio
- Near optimal online algorithms and fast approximation algorithms for resource allocation problems
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- Combinatorial online optimization
- Machine Learning: ECML 2004
- The relative worst order ratio for online algorithms
- Online (J, K)-search problem and its competitive analysis
Cited in
(13)- Flood search under the California split rule.
- Searching and on-line recognition of star-shaped polygons.
- Optimal online \(k\)-min search
- Tight analysis of a self-approaching strategy for the online kernel-search problem
- Models and algorithms for online exploration and search.
- Competitive Online Approximation of the Optimal Search Ratio
- Online Searching
- The expected asymptotical ratio for preemptive stochastic online problem
- Searching a fixed graph
- The tourist in the shopping arcade
- Position-independent near optimal searching and on-line recognition in star polygons
- On-line search in two-dimensional environment
- On-line search in two-dimensional environment
This page was built for publication: Competitive online approximation of the optimal search ratio
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464592)