Recommendations
Cited in
(only showing first 100 items - show all)- The online knapsack problem: advice and randomization
- Improved analysis of the online set cover problem with advice
- Comparison of different approaches to multistage lot sizing with uncertain demand
- Online network design with outliers
- scientific article; zbMATH DE number 437568 (Why is no real title available?)
- Average-case competitive analyses for one-way trading
- Bin packing problems with rejection penalties and their dual problems
- The Canadian Traveller Problem and its competitive analysis
- Optimal broadcasting with universal lists based on competitive analysis*
- Competitive analysis of maintaining frequent items of a stream
- Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
- Algorithms for on-line bin-packing problems with cardinality constraints
- Strongly competitive algorithms for caching with pipelined prefetching
- Online request server matching
- Lower bound algorithms for multiprocessor task scheduling with ready times
- On the on-line rent-or-buy problem in probabilistic environments
- On-line vertex-covering
- Parameter learning algorithm for the online data acknowledgment problem
- Multiprofessor scheduling
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- On minimum \(k\)-modal partitions of permutations
- Offline file assignments for online load balancing
- Preemptive scheduling in overloaded systems.
- Achievable performance of blind policies in heavy traffic
- Energy-optimal broadcast and exploration in a tree using mobile agents
- Beachcombing on strips and islands
- Batched bin packing
- Time traps in supply chains: is optimal still good enough?
- Online bin packing with resource augmentation
- Sequential selection of a monotone subsequence from a random permutation
- An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
- Ronald Graham: laying the foundations of online optimization
- On the power of randomness versus advice in online computation
- Competitive strategy for on-line leasing of depreciable equipment
- Online algorithms: a survey
- Randomized distributed online algorithms against adaptive offline adversaries
- Algorithms for on-line order batching in an order picking warehouse
- Online Algorithms for Multilevel Aggregation
- Online scheduling with rejection and withdrawal
- On-line scheduling with precedence constraints
- Improved lower bounds for the online bin stretching problem
- A general decomposition theorem for the k-server problem
- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
- Multidimensional online motion planning for a spherical robot
- Strategies for dispatching AGVs at automated seaport container terminals
- On-line maximum-order induced hereditary subgraph problems
- Algorithm for online 3-path vertex cover
- Online coloring a token graph
- An optimal online algorithm for single-processor scheduling problem with learning effect
- On the effectiveness of the harmonic shelf algorithm for on-line strip packing
- Equilibria in online games
- Online hypergraph coloring
- New results for online page replication
- An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts
- Competitive analysis of incentive compatible on-line auctions
- Scheduling broadcasts with deadlines
- On the separation and equivalence of paging strategies and other online algorithms
- Online coupon consumption problem
- Online stochastic optimization under time constraints
- Directed pathwidth and palletizers
- Randomized priority algorithms
- 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
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)
