Online algorithms: a survey
From MaRDI portal
Publication:1403281
DOI10.1007/s10107-003-0436-0zbMath1035.68136MaRDI QIDQ1403281
Publication date: 1 September 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0436-0
68W40: Analysis of algorithms
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68W25: Approximation algorithms
Related Items
Measuring the problem-relevant information in input, Makespan minimization in online scheduling with machine eligibility, Makespan minimization in online scheduling with machine eligibility, Supply Chain Management with Online Customer Selection, Competitive analysis of the online financial lease problem, Connectivity games over dynamic networks, Scheduling light-trails on WDM rings, The optimal structure of algorithms for \(\alpha\)-paging, A theoretical comparison of LRU and LRU-K, Scheduling unit length jobs on parallel machines with lookahead information, Improved bounds for online scheduling with eligibility constraints, On-line scheduling mesh jobs with dependencies, The beachcombers' problem: walking and searching with mobile robots, Online scheduling of parallel jobs on two machines is 2-competitive, Clever or smart: strategies for the online target date assignment problem, A survey on metaheuristics for stochastic combinatorial optimization, Offline file assignments for online load balancing, \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm, The online knapsack problem: advice and randomization, Analysis of seat allocation and overbooking decisions with hybrid information, A Survey of Algorithms and Models for List Update, A survey on combinatorial optimization in dynamic environments, Advice complexity of disjoint path allocation, On Shape Optimization with Stochastic Loadings, Uncertainty feature optimization: An implicit paradigm for problems with noisy data, Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures, From Cost Sharing Mechanisms to Online Selection Problems
