Online algorithms. The state of the art
From MaRDI portal
Publication:1048670
DOI10.1007/BFB0029561zbMATH Open1177.68009OpenAlexW1512794094MaRDI QIDQ1048670FDOQ1048670
Authors:
Publication date: 7 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0029561
Recommendations
Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Cited In (only showing first 100 items - show all)
- Connectivity games over dynamic networks
- Online searching with turn cost
- An online 2-dimensional clustering problem with variable sized clusters
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
- On the complexity of the FIFO stack-up problem
- Online traveling salesman problems with service flexibility
- Semi-online scheduling with ``end of sequence information
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
- On-line scheduling of parallel jobs with runtime restrictions
- Approximating total flow time on parallel machines
- An analysis of totally clairvoyant scheduling
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
- Semi-on-line multiprocessor scheduling with given total processing time
- Learning lexicographic orders
- Tight bounds for online class-constrained packing
- Risk-reward models for on-line leasing of depreciable equipment
- Online scheduling of equal-processing-time task systems
- A sequential ordering problem in automotive paint shops
- Dynamic location problems with limited look-ahead
- A new lower bound for the list update problem in the partial cost model
- Title not available (Why is that?)
- On-line scheduling revisited
- On-line scheduling with tight deadlines.
- On-line scheduling on a single machine: Maximizing the number of early jobs
- Optimal deterministic algorithms for some variants of online quota traveling salesman problem
- Online bin covering: expectations vs. guarantees
- Stack-up algorithms for palletizing at delivery industry
- A note on on-line scheduling with partial information
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines
- Bin packing with controllable item sizes
- Dynamic mechanism design
- Searching for an axis-parallel shoreline
- A lower bound for on-line scheduling on uniformly related machines
- Recent advances on two-dimensional bin packing problems
- The \(k\)-server problem
- Online graph exploration: New results on old and new algorithms
- Algorithms for the on-line quota traveling salesman problem
- A new model for the linear 1-dimensional online clustering problem
- The on-line asymmetric traveling salesman problem
- 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 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
- The online knapsack problem: advice and randomization
- Online network design with outliers
- Average-case competitive analyses for one-way trading
- The Canadian Traveller Problem and its competitive analysis
- Algorithms for on-line bin-packing problems with cardinality constraints
- 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
- Lower bound algorithms for multiprocessor task scheduling with ready times
- On the on-line rent-or-buy problem in probabilistic environments
- Parameter learning algorithm for the online data acknowledgment problem
- On-line vertex-covering
- On minimum \(k\)-modal partitions of permutations
- Batched bin packing
- Online bin packing with resource augmentation
- An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
- Online algorithms: a survey
- Competitive strategy for on-line leasing of depreciable equipment
- Algorithms for on-line order batching in an order picking warehouse
- On-line scheduling with precedence constraints
- Online scheduling with rejection and withdrawal
- A general decomposition theorem for the \(k\)-server problem
- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
- Strategies for dispatching AGVs at automated seaport container terminals
- On-line maximum-order induced hereditary subgraph problems
- Online hypergraph coloring
- 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 stochastic optimization under time constraints
- Randomized priority algorithms
- Online matching on a line
- Theory and Applications of Models of Computation
- 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
- Utilization of nonclairvoyant online schedules
- Online Algorithms
- 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
- On-line scheduling of small open shops
- A note on on-line scheduling with precedence constraints on identical machines
- On-line load balancing of temporary tasks revisited
- ON THE k-TRUCK SCHEDULING PROBLEM
- ON ONLINE SCHEDULING JOBS WITH RESTART TO MAXIMIZE THE NUMBER OF JOBS COMPLETED TIME ON A SINGLE MACHINE
- Clever or smart: strategies for the online target date assignment problem
- AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM
- Discrete online TSP
- Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties
- Online Vehicle Routing Problems: A Survey
- Competitive caching of query results in search engines
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
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)