Online algorithms. The state of the art
From MaRDI portal
Publication:1048670
DOI10.1007/BFb0029561zbMath1177.68009OpenAlexW1512794094MaRDI QIDQ1048670
No author found.
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
Analysis of algorithms (68W40) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Online algorithms; streaming algorithms (68W27)
Related Items (only showing first 100 items - show all)
Grid scheduling by on-line rectangle packing ⋮ A sequential ordering problem in automotive paint shops ⋮ On the Power of Randomness versus Advice in Online Computation ⋮ New models of graph-bin packing ⋮ Approximating total flow time on parallel machines ⋮ Directed Pathwidth and Palletizers ⋮ ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH ⋮ ON ONLINE SCHEDULING JOBS WITH RESTART TO MAXIMIZE THE NUMBER OF JOBS COMPLETED TIME ON A SINGLE MACHINE ⋮ Can Burrows-Wheeler transform be replaced in chain code compression? ⋮ Comparison of different approaches to multistage lot sizing with uncertain demand ⋮ Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties ⋮ An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts ⋮ Online Matching in Regular Bipartite Graphs with Randomized Adversary ⋮ Bounds on oblivious multiparty quantum communication complexity ⋮ Online Algorithms for Multilevel Aggregation ⋮ ON THE k-TRUCK SCHEDULING PROBLEM ⋮ Online scheduling with machine cost and rejection ⋮ An analysis of totally clairvoyant scheduling ⋮ Linear programming with online learning ⋮ Two-dimensional bin packing with one-dimensional resource augmentation ⋮ Online Vehicle Routing Problems: A Survey ⋮ On-line scheduling on a single machine: Maximizing the number of early jobs ⋮ An on-line bin-batching problem. ⋮ On-line scheduling of small open shops ⋮ Online bin packing of squares and cubes ⋮ On-line maximum-order induced hereditary subgraph problems ⋮ Dynamic location problems with limited look-ahead ⋮ Bin packing problems with rejection penalties and their dual problems ⋮ Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios ⋮ Online searching with turn cost ⋮ A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints ⋮ On-line load balancing of temporary tasks revisited ⋮ A new lower bound for the list update problem in the partial cost model ⋮ On-line scheduling of parallel jobs with runtime restrictions ⋮ Online request server matching ⋮ Utilization of nonclairvoyant online schedules ⋮ Equilibria in Online Games ⋮ Optimal oblivious routing in polynomial time ⋮ MULTIDIMENSIONAL ONLINE MOTION PLANNING FOR A SPHERICAL ROBOT ⋮ Nonadaptive Selfish Routing with Online Demands ⋮ Optimal broadcasting with universal lists based on competitive analysis* ⋮ Achievable Performance of Blind Policies in Heavy Traffic ⋮ AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM ⋮ Sequential selection of a monotone subsequence from a random permutation ⋮ Discrete online TSP ⋮ Parameter learning algorithm for the online data acknowledgment problem ⋮ Online traveling salesman problems with service flexibility ⋮ A randomized on–line algorithm for the k–server problem on a line ⋮ Obtaining online approximation algorithms for facility dispersion from offline algorithms ⋮ Lower bound algorithms for multiprocessor task scheduling with ready times ⋮ A Robust AFPTAS for Online Bin Packing with Polynomial Migration ⋮ Semi-online scheduling jobs with tightly-grouped processing times on three identical machines ⋮ A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem ⋮ A Semi-Online Algorithm for Single Machine Scheduling with Rejection ⋮ Scheduling broadcasts with deadlines ⋮ Competitive analysis of incentive compatible on-line auctions ⋮ Algorithms for the on-line quota traveling salesman problem ⋮ A note on on-line scheduling with partial information ⋮ Learning lexicographic orders ⋮ Algorithms for on-line bin-packing problems with cardinality constraints ⋮ New results for online page replication ⋮ Competitive caching of query results in search engines ⋮ Optimal deterministic algorithms for some variants of online quota traveling salesman problem ⋮ Bin packing with divisible item sizes and rejection penalties ⋮ Online bin covering: expectations vs. guarantees ⋮ Competitive online multicommodity routing ⋮ On the online min-wait relocation problem ⋮ The Canadian tour operator problem on paths: tight bounds and resource augmentation ⋮ Online network design with outliers ⋮ Online scheduling problems with flexible release dates: applications to infrastructure restoration ⋮ Strongly competitive algorithms for caching with pipelined prefetching ⋮ Improved lower bounds for the online bin stretching problem ⋮ Tight bounds for online class-constrained packing ⋮ Improved analysis of the online set cover problem with advice ⋮ Time traps in supply chains: is optimal still good enough? ⋮ Connectivity games over dynamic networks ⋮ Online graph exploration: New results on old and new algorithms ⋮ The off-line group seat reservation problem ⋮ Multiprofessor scheduling ⋮ An online 2-dimensional clustering problem with variable sized clusters ⋮ On-line scheduling with tight deadlines. ⋮ Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine ⋮ Preemptive scheduling in overloaded systems. ⋮ Average-case competitive analyses for one-way trading ⋮ Risk-reward models for on-line leasing of depreciable equipment ⋮ Online bin packing with resource augmentation ⋮ Offline file assignments for online load balancing ⋮ A risk-reward model for the on-line leasing of depreciable equipment ⋮ Strategies for dispatching AGVs at automated seaport container terminals ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ The online knapsack problem: advice and randomization ⋮ Searching for an axis-parallel shoreline ⋮ An adversarial model for scheduling with testing ⋮ Competitive strategy for on-line leasing of depreciable equipment ⋮ Online stochastic optimization under time constraints ⋮ The \(k\)-server problem ⋮ Online scheduling with rejection and withdrawal ⋮ A lower bound for on-line scheduling on uniformly related machines ⋮ Competitive analysis of maintaining frequent items of a stream ⋮ On the effectiveness of the harmonic shelf algorithm for on-line strip packing
This page was built for publication: Online algorithms. The state of the art
