Recommendations
Cited in
(only showing first 100 items - show all)- Online matching on a line
- Connectivity games over dynamic networks
- Progressive learning: a deep learning framework for continual learning
- Off-line temporary tasks assignment.
- On list update and work function algorithms.
- Online variable sized covering
- Online searching with turn cost
- Theory and Applications of Models of Computation
- An online 2-dimensional clustering problem with variable sized clusters
- On the complexity of the FIFO stack-up problem
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
- On the power of lookahead in on-line server routing problems
- Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying
- Utilization of nonclairvoyant online schedules
- Semi-online scheduling with ``end of sequence information
- Online traveling salesman problems with service flexibility
- Online Algorithms
- A note on on-line scheduling with precedence constraints on identical machines
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
- On-line scheduling of small open shops
- Approximating total flow time on parallel machines
- Clever or smart: strategies for the online target date assignment problem
- On-line load balancing of temporary tasks revisited
- ON THE k-TRUCK SCHEDULING PROBLEM
- On-line scheduling of parallel jobs with runtime restrictions
- ON ONLINE SCHEDULING JOBS WITH RESTART TO MAXIMIZE THE NUMBER OF JOBS COMPLETED TIME ON A SINGLE MACHINE
- Semi-on-line multiprocessor scheduling with given total processing time
- An analysis of totally clairvoyant scheduling
- Tight bounds for online class-constrained packing
- Learning lexicographic orders
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
- Competitive caching of query results in search engines
- AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM
- Discrete online TSP
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
- Risk-reward models for on-line leasing of depreciable equipment
- Online Vehicle Routing Problems: A Survey
- General bounds for incremental maximization
- Online scheduling of equal-processing-time task systems
- Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties
- The online \(k\)-server problem with rejection
- A sequential ordering problem in automotive paint shops
- Bounds on oblivious multiparty quantum communication complexity
- Tighter bounds for the harmonic bin packing algorithm
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Obtaining online approximation algorithms for facility dispersion from offline algorithms
- Dynamic location problems with limited look-ahead
- Randomized algorithms for on-line scheduling problems: How low can't you go?
- A new lower bound for the list update problem in the partial cost model
- On-line scheduling of multi-core processor tasks with virtualization
- Online decision making and automatic decision model adaptation
- New models of graph-bin packing
- A robust AFPTAS for online bin packing with polynomial migration
- On-line scheduling revisited
- scientific article; zbMATH DE number 5957338 (Why is no real title available?)
- On-line scheduling with tight deadlines.
- Optimal deterministic algorithms for some variants of online quota traveling salesman problem
- Online bin covering: expectations vs. guarantees
- Online capacity planning for rehabilitation treatments: an approximate dynamic programming approach
- An on-line bin-batching problem.
- Competitive online multicommodity routing
- Stack-up algorithms for palletizing at delivery industry
- Linear programming with online learning
- On-line scheduling on a single machine: Maximizing the number of early jobs
- A note on on-line scheduling with partial information
- Bin packing with controllable item sizes
- Dynamic mechanism design
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines
- Searching for an axis-parallel shoreline
- Nonadaptive Selfish Routing with Online Demands
- Grid scheduling by on-line rectangle packing
- An adversarial model for scheduling with testing
- Idle regulation in non-clairvoyant scheduling of parallel jobs
- A lower bound for on-line scheduling on uniformly related machines
- Online Matching in Regular Bipartite Graphs with Randomized Adversary
- A semi-online algorithm for single machine scheduling with rejection
- The \(k\)-server problem
- Recent advances on two-dimensional bin packing problems
- Online graph exploration: New results on old and new algorithms
- A randomized on–line algorithm for the k–server problem on a line
- Algorithms for the on-line quota traveling salesman problem
- Two-dimensional bin packing with one-dimensional resource augmentation
- The on-line asymmetric traveling salesman problem
- Online scheduling problems with flexible release dates: applications to infrastructure restoration
- A new model for the linear 1-dimensional online clustering problem
- Bin packing with divisible item sizes and rejection penalties
- In memoriam: Gerhard Woeginger (1964--2022)
- Online scheduling with machine cost and rejection
- A risk-reward model for the on-line leasing of depreciable equipment
- On the online min-wait relocation problem
- The Canadian tour operator problem on paths: tight bounds and resource augmentation
- The off-line group seat reservation problem
- An approximation algorithm for square packing.
- A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
- Exact distributional analysis of online algorithms with lookahead
- A class of on-line scheduling algorithms to minimize total completion time
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- Online bin packing of squares and cubes
- Can Burrows-Wheeler transform be replaced in chain code compression?
- Optimal oblivious routing in polynomial time
This page was built for publication: Online algorithms. The state of the art
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1048670)
