Online algorithms: a survey
From MaRDI portal
Publication:1403281
DOI10.1007/s10107-003-0436-0zbMath1035.68136OpenAlexW158123262MaRDI 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
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Approximation algorithms (68W25)
Related Items (56)
From Cost Sharing Mechanisms to Online Selection Problems ⋮ Analysis of seat allocation and overbooking decisions with hybrid information ⋮ Independent Sets in Restricted Line of Sight Networks ⋮ A survey on combinatorial optimization in dynamic environments ⋮ Competitive analysis of the online financial lease problem ⋮ Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures ⋮ Measuring the problem-relevant information in input ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ On-line scheduling mesh jobs with dependencies ⋮ Improved analysis of the online set cover problem with advice ⋮ Testing facility location and dynamic capacity planning for pandemics with demand uncertainty ⋮ An online optimization approach for post-disaster relief distribution with online blocked edges ⋮ Partial sorting problem on evolving data ⋮ A theoretical comparison of LRU and LRU-K ⋮ Connectivity games over dynamic networks ⋮ Replenishment Policy with Limited Price Information ⋮ An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller ⋮ Advice complexity of disjoint path allocation ⋮ Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency ⋮ The beachcombers' problem: walking and searching with mobile robots ⋮ Literature reviews in operations research: a new taxonomy and a meta review ⋮ A survey on risk-averse and robust revenue management ⋮ On Shape Optimization with Stochastic Loadings ⋮ Unnamed Item ⋮ Offline file assignments for online load balancing ⋮ Real-time management of berth allocation with stochastic arrival and handling times ⋮ The online knapsack problem: advice and randomization ⋮ Scheduling light-trails on WDM rings ⋮ A unified framework for stochastic optimization ⋮ Online scheduling of parallel jobs on two machines is 2-competitive ⋮ Scheduling unit length jobs on parallel machines with lookahead information ⋮ A competitive analysis for the start-gap algorithm for online memory wear leveling ⋮ Online failure diagnosis in interdependent networks ⋮ A Risk–Reward Model for On-line Financial Leasing Problem with an Interest Rate ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ The optimal structure of algorithms for \(\alpha\)-paging ⋮ Uncertainty feature optimization: An implicit paradigm for problems with noisy data ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Clever or smart: strategies for the online target date assignment problem ⋮ Supply Chain Management with Online Customer Selection ⋮ Improved bounds for online scheduling with eligibility constraints ⋮ Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms ⋮ Beachcombing on strips and islands ⋮ Dynamic programming optimization in line of sight networks ⋮ Algorithm for online 3-path vertex cover ⋮ Prior-free online mechanisms for queueing with arrivals ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model ⋮ New results on competitive analysis of online SRPT scheduling ⋮ Firefighting on trees ⋮ Online economic ordering problem for deteriorating items with limited price information ⋮ A Survey of Algorithms and Models for List Update ⋮ Unnamed Item ⋮ \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm ⋮ Scheduling with a processing time oracle ⋮ Adaptive Bin Packing with Overflow
This page was built for publication: Online algorithms: a survey
