Online algorithms: a survey
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)
Recommendations
Cited in
(71)- A survey on metaheuristics for stochastic combinatorial optimization
- Online algorithms. The state of the art
- Partial sorting problem on evolving data
- A survey on risk-averse and robust revenue management
- Real-time management of berth allocation with stochastic arrival and handling times
- A unified framework for stochastic optimization
- Delayed information and action in on-line algorithms
- Offline file assignments for online load balancing
- Ronald Graham: laying the foundations of online optimization
- Prior-free online mechanisms for queueing with arrivals
- 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
- Online economic ordering problem for deteriorating items with limited price information
- Scheduling with a processing time oracle
- Testing facility location and dynamic capacity planning for pandemics with demand uncertainty
- A competitive analysis for the start-gap algorithm for online memory wear leveling
- Online failure diagnosis in interdependent networks
- 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
- Firefighting on trees
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
- Approximation and online algorithms for multidimensional bin packing: a survey
- Improved analysis of the online set cover problem with advice
- The online knapsack problem: advice and randomization
- Analysis of seat allocation and overbooking decisions with hybrid information
- An online optimization approach for post-disaster relief distribution with online blocked edges
- scientific article; zbMATH DE number 1688603 (Why is no real title available?)
- A Survey of Algorithms and Models for List Update
- Theory and implementation of online multiselection algorithms
- 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
- scientific article; zbMATH DE number 5957338 (Why is no real title available?)
- scientific article; zbMATH DE number 437568 (Why is no real title available?)
- Formal Analysis of Online Algorithms
- Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
- Competitive analysis of the online financial lease problem
- From cost sharing mechanisms to online selection problems
- Connectivity games over dynamic networks
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- Scheduling light-trails on WDM rings
- A Risk–Reward Model for On-line Financial Leasing Problem with an Interest Rate
- The optimal structure of algorithms for \(\alpha\)-paging
- Independent Sets in Restricted Line of Sight Networks
- Dynamic resource allocation in the cloud with near-optimal efficiency
- Online Algorithms for Multilevel Aggregation
- Foundations of online structure theory. II: The operator approach
- Measuring the problem-relevant information in input
- Supply chain management with online customer selection
- Adaptive Bin Packing with Overflow
- scientific article; zbMATH DE number 7651167 (Why is no real title available?)
- Makespan minimization in online scheduling with machine eligibility
- Theory and Applications of Models of Computation
- Makespan minimization in online scheduling with machine eligibility
- Replenishment Policy with Limited Price Information
- An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller
- Literature reviews in operations research: a new taxonomy and a meta review
- A theoretical comparison of LRU and LRU-K
- Online Algorithms
- Scheduling unit length jobs on parallel machines with lookahead information
- Online two-dimensional load balancing
- A survey of online knapsack problems
- Temporal separators with deadlines
- 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
This page was built for publication: Online algorithms: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1403281)
