The following pages link to Online algorithms: a survey (Q1403281):
Displayed 27 items.
- Competitive analysis of the online financial lease problem (Q322578) (← links)
- Connectivity games over dynamic networks (Q391110) (← links)
- Scheduling light-trails on WDM rings (Q455990) (← links)
- The optimal structure of algorithms for \(\alpha\)-paging (Q495673) (← links)
- A theoretical comparison of LRU and LRU-K (Q611043) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- On-line scheduling mesh jobs with dependencies (Q870843) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Online scheduling of parallel jobs on two machines is 2-competitive (Q924886) (← links)
- Clever or smart: strategies for the online target date assignment problem (Q968114) (← links)
- A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
- Offline file assignments for online load balancing (Q1944067) (← links)
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206) (← links)
- The online knapsack problem: advice and randomization (Q2437775) (← links)
- Analysis of seat allocation and overbooking decisions with hybrid information (Q2629656) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Advice complexity of disjoint path allocation (Q2953693) (← links)
- On Shape Optimization with Stochastic Loadings (Q2961065) (← links)
- Uncertainty feature optimization: An implicit paradigm for problems with noisy data (Q3008922) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- From Cost Sharing Mechanisms to Online Selection Problems (Q3449447) (← links)
- Measuring the problem-relevant information in input (Q5321779) (← links)
- Supply Chain Management with Online Customer Selection (Q5740223) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)