scientific article; zbMATH DE number 1232130
From MaRDI portal
zbMath0931.68015MaRDI QIDQ4223058
Publication date: 9 December 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Applications of game theory (91A80) Markov and semi-Markov decision processes (90C40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Portfolio theory (91G10) Theory of computing (68Q99)
Related Items
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments, Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions, Breaking the 2-competitiveness barrier for two servers in a tree, Replenishment Policy with Limited Price Information, An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller, Competitive Algorithms for Generalized k -Server in Uniform Metrics, Online Metric Algorithms with Untrusted Predictions, Online max-min fair allocation, Online car-sharing problem with variable booking times, Fully Online Matching with Advice on General Bipartite Graphs and Paths, Relative Worst-Order Analysis: A Survey, Length-Weighted Disjoint Path Allocation, Online Matching in Regular Bipartite Graphs with Randomized Adversary, On the Advice Complexity of Online Edge- and Node-Deletion Problems, Hitting geometric objects online via points in \(\mathbb{Z}^d\), Scheduling appointments online: the power of deferred decision-making, Canadian traveller problem with predictions, Online interval scheduling with predictions, Advice complexity bounds for online delayed \(\mathcal{F} \)-node-, \(H\)-node- and \(H\)-edge-deletion problems, Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\), Online Spanners in Metric Spaces, Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty, Unnamed Item, Primitive recursive ordered fields and some applications, Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing, On packet scheduling with adversarial jamming and speedup, Car-sharing between two locations: online scheduling with flexible advance bookings, The k-Server Problem with Delays on the Uniform Metric Space, Dynamic storage allocation with known durations, Randomized on-line scheduling on two uniform machines, An Online Model of Berth and Quay Crane Integrated Allocation in Container Terminals, Online Scheduling for Electricity Cost in Smart Grid, Learning in network contexts: experimental results from simulations, A general class of adaptive strategies, Advice complexity of priority algorithms, On paging with locality of reference, 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 paging and file caching with expiration times, An optimal online algorithm for scheduling two machines with release times, Online request server matching, Complexity and online algorithms for minimum skyline coloring of intervals, Absolute and asymptotic bounds for online frequency allocation in cellular networks, Online Minimum Spanning Tree with Advice, Overflow management with self-eliminations, Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs, Query minimization under stochastic uncertainty, Online unit covering in Euclidean space, Overflow management with self-eliminations, An optimal algorithm for 2-bounded delay buffer management with lookahead, Minimum Cost Perfect Matching with Delays for Two Sources, Further Results on Online Node- and Edge-Deletion Problems with Advice, Online Bin Packing with Advice of Small Size, The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One Dimension, Randomization Helps Computing a Minimum Spanning Tree under Uncertainty, Online Multi-Coloring with Advice, Online Dual Edge Coloring of Paths and Trees, Online Graph Coloring Against a Randomized Adversary, Online Priority Steiner Tree Problems, Essential Traffic Parameters for Shared Memory Switch Performance, A Randomized Algorithm for Online Scheduling with Interval Conflicts, An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization, Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead, Disjoint Path Allocation with Sublinear Advice, On Energy-Efficient Computations With Advice, Measuring the problem-relevant information in input, Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs, Online Matching in Regular Bipartite Graphs, Unnamed Item, A Practical Approach for the FIFO Stack-Up Problem, Average-Case Competitive Analyses for One-Way Trading, New Algorithms for Online Rectangle Filling with k-Lookahead, An Optimal Strategy for Online Non-uniform Length Order Scheduling, A Preemptive Algorithm for Maximizing Disjoint Paths on Trees, Unnamed Item, Unnamed Item, Approximations to Stochastic Dynamic Programs via Information Relaxation Duality, Online Algorithms for Multilevel Aggregation, Tight Bounds for Online Vector Scheduling, Tight Bounds for Restricted Grid Scheduling, A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry, Improved Randomized Results for That Interval Selection Problem, Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison, Advice Complexity and Barely Random Algorithms, PORTFOLIO SELECTION AND ONLINE LEARNING, Optimal smoothing schedules for real-time streams, On the Relative Dominance of Paging Algorithms, The complexity of recursion theoretic games, FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS, Online Scheduling with Increasing Subsequence Serving Constraint, A Risk–Reward Model for On-line Financial Leasing Problem with an Interest Rate, A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism, On-line Scheduling with a Monotonous Subsequence Constraint, On Approximation Algorithms for Two-Stage Scheduling Problems, Competitive algorithms and lower bounds for online randomized call control in cellular networks, OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING, Price Fluctuations: To Buy or to Rent, On the Additive Constant of the k-Server Work Function Algorithm, Unnamed Item, Online Vehicle Routing Problems: A Survey, ASSIGNMENT QUERY AND ITS IMPLEMENTATION IN MOVING OBJECT DATABASES, Online Scheduling on a CPU-GPU Cluster, Unnamed Item, New policies for the dynamic traveling salesman problem, On-line VWAP Trading Strategies, Unnamed Item, Critical sizing of LRU caches with dependent requests, Unnamed Item, Improved Randomized Online Scheduling of Unit Length Intervals and Jobs, Randomized Algorithms for Buffer Management with 2-Bounded Delay, Peak Shaving through Resource Buffering, Caching Content under Digital Rights Management, A Randomized Algorithm for Two Servers in Cross Polytope Spaces, Online Rectangle Filling, Object Caching for Queries and Updates, Scheduling to Maximize Participation, Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis, On Certain New Models for Paging with Locality of Reference, Project scheduling under competition, Nonadaptive Selfish Routing with Online Demands, List Update with Locality of Reference, KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS, ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO, Multi-Priority Online Scheduling with Cancellations, Achievable Performance of Blind Policies in Heavy Traffic, Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process, AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM, Discrete online TSP, Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers, On Job Scheduling with Preemption Penalties, FOUNDATIONS OF ONLINE STRUCTURE THEORY, An Improved Online Algorithm for the Traveling Repairperson Problem on a Line, Query-Competitive Sorting with Uncertainty., Multi-Finger Binary Search Trees, Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings., OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE, Economical Caching with Stochastic Prices, Randomization Helps Computing a Minimum Spanning Tree under Uncertainty, A randomized on–line algorithm for the k–server problem on a line, Unnamed Item, Obtaining online approximation algorithms for facility dispersion from offline algorithms, Unnamed Item, Fleet management for autonomous vehicles: Online PDP under special constraints, Online hypergraph coloring with rejection, Towards using the history in online computation with advice, A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem, Stochastic Online Scheduling Revisited, Unnamed Item, Unnamed Item, Minimum Congestion Mapping in a Cloud, Online maximum matching with recourse, Primitive recursive ordered fields and some applications, Models of greedy algorithms for graph problems, Optimal algorithms for \(k\)-search with application in option pricing, Algorithms for the on-line quota traveling salesman problem, Minimum cost perfect matching with delays for two sources, Competitive analysis of online revenue management with hierarchical resources, Improved on-line broadcast scheduling with deadlines, On the relative dominance of paging algorithms, Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time, Online \(k\)-server routing problems, Competitive online multicommodity routing, Greedy online frequency allocation in cellular networks, Transactional contention management as a Non-clairvoyant scheduling problem, A universal online caching algorithm based on pattern matching, Evaluating the quality of online optimization algorithms by discrete event simulation, Online algorithms with advice for the dual bin packing problem, Online spatio-temporal matching in stochastic and dynamic domains, Online scheduling problems with flexible release dates: applications to infrastructure restoration, The Steiner traveling salesman problem with online advanced edge blockages, An improved algorithm for online coloring of intervals with bandwidth, On the remote server problem or more about TCP acknowledgments, Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs, On-line supply chain scheduling problems with preemption, Dynamic bin packing with unit fraction items revisited, On the additive constant of the \(k\)-server work function algorithm, A hard dial-a-ride problem that is easy on average, Scheduling search procedures: The wheel of fortune, R-LINE: a better randomized 2-server algorithm on the line, Competitive video on demand schedulers for popular movies, More on randomized on-line algorithms for caching., News from the online traveling repairman., On-line stream merging in a general setting., Nearly optimal strategies for special cases of on-line capital investment., Optimal aggregation algorithms for middleware., Connection caching: Model and algorithms., Preemptive scheduling in overloaded systems., A primal-dual algorithm for online non-uniform facility location, Online scheduling of parallel jobs on two machines is 2-competitive, Competitive analysis of scheduling algorithms for aggregated links, A randomized competitive algorithm for evaluating priced AND/OR trees, Scheduling to maximize participation, The on-line asymmetric traveling salesman problem, On-line scheduling of parallel jobs on two machines, On the power of lookahead in on-line server routing problems, How much can lookahead help in online single machine scheduling, A note on the \(k\)-Canadian traveller problem, Comparing first-fit and next-fit for online edge coloring, An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times, Clever or smart: strategies for the online target date assignment problem, Class constrained bin covering, A preemptive algorithm for maximizing disjoint paths on trees, Optimal on-line colorings for minimizing the number of ADMs in optical networks, Randomized priority algorithms, Tight results for next fit and worst fit with resource augmentation, Online chasing problems for regular polygons, Ski rental with two general options, Online hypergraph coloring, Deterministic on-line call control in cellular networks, Improved randomized results for the interval selection problem, TCP is competitive with resource augmentation, On the two-dimensional cow search problem, New lower bounds for online \(k\)-server routing problems, Competitive analysis of the online inventory problem, Competitive analysis of online real-time scheduling algorithms under hard energy constraint, Scheduling of online compute-intensive synchronized jobs on high performance virtual clusters, Dynamic TCP acknowledgment with sliding window, Data aggregation in sensor networks: Balancing communication and delay costs, Hitting sets online and unique-MAX coloring, On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles, The string guessing problem as a method to prove lower bounds on the advice complexity, Queuing with future information, On dynamic bin packing: An improved lower bound and resource augmentation analysis, Online scheduling on two uniform machines to minimize the makespan, A survey on metaheuristics for stochastic combinatorial optimization, New lower and upper bounds for the competitive ratio of transmission protocols, A note on online strip packing, Online call control in cellular networks revisited, A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time, Online interval scheduling: Randomized and multiprocessor cases, Online search with time-varying price bounds, Online scheduling to minimize modified total tardiness with an availability constraint, The Canadian Traveller Problem and its competitive analysis, Two-stage flexible-choice problems under uncertainty, An optimal online algorithm for single machine scheduling with bounded delivery times, On-line integrated production-distribution scheduling problems with capacitated deliveries, Optimal algorithms for page migration in dynamic networks, A tight lower bound for job scheduling with cancellation, Randomized distributed online algorithms against adaptive offline adversaries, Dynamic spectrum allocation: the impotency of duration notification., Minmax regret solutions for minimax optimization problems with uncertainty, Stack-up algorithms for palletizing at delivery industry, On-line scheduling revisited, On-line and off-line preemptive two-machine job shop scheduling, The power of \(\alpha\)-points in preemptive single machine scheduling., On-line scheduling with precedence constraints, Trackless online algorithms for the server problem, Limited bookmark randomized online algorithms for the paging problem, Online strategies for backups, Randomized algorithms for on-line scheduling problems: How low can't you go?, Grid scheduling by on-line rectangle packing, The impact of processing order on performance: a taxonomy of semi-FIFO policies, A Semantical Approach to Equilibria and Rationality, Bottleneck Congestion Games with Logarithmic Price of Anarchy, On the Power of Randomness versus Advice in Online Computation, Learning lexicographic orders, Online Optimization of Busy Time on Parallel Machines, New models of graph-bin packing, Job shop scheduling with unit length tasks, Dynamic bin packing of unit fractions items, Uniform metrical task systems with a limited number of states, The complexity of online manipulation of sequential elections, A tight bound for online colouring of disk graphs, Efficient and fair routing for mesh networks, Online calibrated forecasts: memory efficiency versus universality for learning in games, On-line production order scheduling with preemption penalties, Strongly competitive algorithms for caching with pipelined prefetching, The \(k\)-Canadian travelers problem with communication, Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints, On the advice complexity of the \(k\)-server problem, Improved lower bounds for the online bin stretching problem, Approximation and online algorithms for multidimensional bin packing: a survey, Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines, Improved analysis of the online set cover problem with advice, Query-competitive sorting with uncertainty, Approximating the Canadian traveller problem with online randomization, Online packet-routing in grids with bounded buffers, Online regenerator placement, General caching is hard: even with small pages, Fibonacci helps to evacuate from a convex region in a grid network, Tight Analysis of Priority Queuing for Egress Traffic, A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey, Stochastization of Weighted Automata, Competitive Strategies for Online Clique Clustering, Advice Complexity of Fine-Grained Job Shop Scheduling, Call admission problems on trees, Online packet scheduling with bounded delay and lookahead, Advice complexity of disjoint path allocation, The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem, Round-competitive algorithms for uncertainty problems with parallel queries, Search Games: A Review, Competitive weighted matching in transversal matroids, Improved competitive performance bounds for CIOQ switches, Competitive algorithms for the bicriteria \(k\)-server problem, A new variable-sized bin packing problem, Semi-online two-level supply chain scheduling problems, The secretary problem with reservation costs, Competitive analysis for make-to-order scheduling with reliable lead time quotation, The online knapsack problem: advice and randomization, Piece selection algorithms for layered video streaming in P2P networks, The covering Canadian traveller problem, Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency, Modeling time criticality of information, A comparison of performance measures via online search, A \(k\)-server problem with parallel requests and unit distances, Online sum-radii clustering, Online competitive algorithms for maximizing weighted throughput of unit jobs, Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates, On the on-line rent-or-buy problem in probabilistic environments, The k-Canadian Travelers Problem with Communication, Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints, Linear programming with online learning, On the Advice Complexity of the k-Server Problem, Online Graph Exploration: New Results on Old and New Algorithms, On the competitive ratio for online facility location, Randomized allocation processes, WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION, Approximation algorithms for problems in scheduling with set-ups, On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan, Path problems in generalized stars, complete graphs, and brick wall graphs, Robust game theory, Competitive analysis for the on-line truck transportation problem, Efficient scheduling of periodic information monitoring requests, Ramsey-type theorems for metric spaces with applications to online problems, A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem, Incremental algorithms for facility location and \(k\)-median, How to whack moles, Competitive auctions, The maximum resource bin packing problem, ONLINE SCHEDULING OF PARALLEL JOBS WITH BOUNDED PROCESSING TIMES ON TWO MACHINES, Equilibria in Online Games, Relative interval analysis of paging algorithms on access graphs, Advice Complexity and Barely Random Algorithms, THRESHOLD RULES FOR ONLINE SAMPLE SELECTION, Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization, Advice Complexity of the Online Search Problem, Parameter learning algorithm for the online data acknowledgment problem, On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks, A Combinatorial Metrical Task System Problem Under the Uniform Metric, Online traveling salesman problems with service flexibility, Topology matters: smoothed competitiveness of metrical task systems, A Survey of Algorithms and Models for List Update, Enhanced prefetching and caching strategies for single- and multi-disk systems, Non-Additive Two-Option Ski Rental, Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie, Optimal Buffer Management for 2-Frame Throughput Maximization, An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths, Optimal online markdown and markup pricing policies with demand uncertainty, Improved lower bounds for the online bin packing problem with cardinality constraints, Competitive strategies for an online generalized assignment problem with a service consecution constraint, Robust option pricing: Hannan and Blackwell meet Black and Scholes, Online integrated production-distribution scheduling problems without preemption, Measuring the impact of adversarial errors on packet scheduling strategies, The online knapsack problem with incremental capacity, A simple analysis of the harmonic algorithm for two servers, Optimal deterministic algorithms for some variants of online quota traveling salesman problem, A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem, The Steiner traveling salesman problem with online edge blockages, On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost, A dynamic learning algorithm for online matching problems with concave returns, A note: An improved upper bound for the online inventory problem with bounded storage and order costs, Competitive analysis of the online financial lease problem, The online prize-collecting facility location problem, The Canadian tour operator problem on paths: tight bounds and resource augmentation, Online network design with outliers, Online interval scheduling on a single machine with finite lookahead, Online ordering policies for a two-product, multi-period stationary newsvendor problem, A stochastic algorithm for online bipartite resource allocation problems, Lower and upper competitive bounds for online directed graph exploration, Better bounds for online \(k\)-frame throughput maximization in network switches, Tight bounds for online class-constrained packing, Strategies in competing subset selection, Online multi-coloring on the path revisited, Bin packing with ``largest in bottom constraint: tighter bounds and generalizations, Online scheduling of simple linear deteriorating jobs to minimize the total general completion time, A theoretical comparison of LRU and LRU-K, Competitive buffer management with packet dependencies, Better bounds on online unit clustering, Connectivity games over dynamic networks, A comprehensive study of an online packet scheduling algorithm, A near-optimal memoryless online algorithm for FIFO buffering two packet classes, Competitive and deterministic embeddings of virtual networks, Online selection of intervals and \(t\)-intervals, On the power of lookahead in online lot-sizing, Online time-constrained scheduling in linear and ring networks, Real-time integrated prefetching and caching, Online scheduling with immediate and reliable lead-time quotation, Energy-efficient multiprocessor scheduling for flow time and makespan, An online 2-dimensional clustering problem with variable sized clusters, Statistical decisions under ambiguity, Optimal online pricing with network externalities, Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times, Average-case competitive analyses for one-way trading, New algorithms for online rectangle filling with \(k\)-lookahead, A randomized algorithm for two servers in cross polytope spaces, Risk-reward models for on-line leasing of depreciable equipment, PAMR: passive aggressive mean reversion strategy for portfolio selection, An optimal online algorithm for single machine scheduling to minimize total general completion time, Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines, On-line scheduling of equal-length intervals on parallel machines, List update with probabilistic locality of reference, Optimal randomized algorithm for a generalized ski-rental with interest rate, Competitive analysis for online leasing problem with compound interest rate, Extensions to online delay management on a single train line: New bounds for delay minimization and profit maximization, Optimal algorithms for online single machine scheduling with deteriorating jobs, Competitive subset selection with two agents, Competitive strategy for on-line leasing of depreciable equipment, Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances, Scheduling light-trails on WDM rings, The \(k\)-server problem, Streaming techniques and data aggregation in networks of tiny artefacts, Axioms for minimax regret choice correspondences, An optimal lower bound for buffer management in multi-queue switches, Competitive analysis of maintaining frequent items of a stream, Online optimization of busy time on parallel machines, On-line machine covering on two machines with local migration, Online coloring of bipartite graphs with and without advice, Improved results for scheduling batched parallel jobs by using a generalized analysis framework, On the separation and equivalence of paging strategies and other online algorithms, Approximating optimal social choice under metric preferences, Quantum online algorithms with respect to space and advice complexity, A comparison of performance measures for online algorithms, The optimal structure of algorithms for \(\alpha\)-paging, Online algorithms with advice for bin packing and scheduling problems, An improved lower bound for one-dimensional online unit clustering, On the list update problem with advice, The complexity of controlling candidate-sequential elections, On the competitiveness of AIMD-TCP within a general network, Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms, Online algorithms with advice: the tape model, Improving LTL truck load utilization on line, Caching is hard -- even in the fault model, Query strategies for priced information, Online facility location with facility movements, Sorting and selection on dynamic data, Online computation with advice, Stochastic convergence of random search methods to fixed size Pareto front approximations, Interval scheduling on related machines, Knowledge state algorithms, On queuing lengths in on-line switching, Randomized competitive algorithms for online buffer management in the adaptive adversary model, Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint, Online rectangle filling, Online leasing problem with price fluctuations under the consumer price index, Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead, A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem, Online scheduling FIFO policies with admission and push-out, Online knapsack revisited, On the complexity of the FIFO stack-up problem, How to allocate goods in an online market?, The complexity of online bribery in sequential elections, Call control with \(k\) rejections, Average stretch without migration, Online scheduling with partial job values: does timesharing or randomization help?, Improved competitive algorithms for online scheduling with partial job values, Competitive analysis of incentive compatible on-line auctions, Online unit clustering and unit covering in higher dimensions, Randomized online computation with high probability guarantees, Harmonic buffer management policy for shared memory switches, New results for online page replication, Competitive caching of query results in search engines, Competitive online routing in geometric graphs, The weighted 2-server problem, On the competitive ratio of the work function algorithm for the \(k\)-server problem, The CNN problem and other \(k\)-server variants, Call admission problems on grids with advice, Machine learning advised ski rental problem with a discount, Online scheduling of car-sharing request pairs between two locations, Online leasing problem with price fluctuations and the second-hand transaction, Greedy algorithms for the profit-aware social team formation problem, The slotted online one-sided crossing minimization problem on 2-regular graphs, A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs, Improved lower bounds for online scheduling to minimize total stretch, Time traps in supply chains: is optimal still good enough?, Online graph exploration: New results on old and new algorithms, Graphs are not universal for online computability, Online clustering with variable sized clusters, A risk-reward model for the on-line leasing of depreciable equipment, Automated competitive analysis of real-time scheduling with graph games, Online edge coloring of paths and trees with a fixed number of colors, Scheduling on parallel identical machines with late work criterion: offline and online cases, List factoring and relative worst order analysis, Optimal online algorithms for the multi-objective time series search problem, Online interval scheduling with a bounded number of failures, A risk-reward model with compound interest rate for non-additive two-option ski rental, Online parallel machine scheduling to maximize the number of early jobs, An adversarial model for scheduling with testing, Online stochastic optimization under time constraints, A unified framework for stochastic optimization, Online two-way trading: randomization and advice, Reallocating multiple facilities on the line, Online node- and edge-deletion problems with advice, Online in-time service problem with minimal server assignment, The \(k\)-server problem with advice in \(d\) dimensions and on the sphere, Online dominating set, Tight bounds for double coverage against weak adversaries, On the smoothness of paging algorithms, An algorithm with performance guarantee for the online container relocation problem, Competitive algorithms for multistage online scheduling, On the advice complexity of the online dominating set problem, The \(k\)-resource problem in uniform metric spaces, Improved randomized online scheduling of intervals and jobs, A new model for the linear 1-dimensional online clustering problem, Metrical service systems with multiple servers, Probability-free solutions to the non-stationary newsvendor problem, Online matching on a line, A universal randomized packet scheduling algorithm, An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones, A tighter extra-resource analysis of online deadline scheduling, Multiple canadians on the road: minimizing the distance competitive ratio, Punctual definability on structures, Online interval scheduling to maximize total satisfaction, Relative utility bounds for empirically optimal portfolios, A securities selling game, Exact distributional analysis of online algorithms with lookahead, Online clique clustering, Analysis of adaptive cost functions for dynamic update policies for QoS routing in hierarchical networks, Stochastic dominance and the bijective ratio of online algorithms, Admission control in shared memory switches, Online scheduling of moldable parallel tasks, Online bin packing with advice of small size, Parameterized analysis of the online priority and node-weighted Steiner tree problems, 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 scheduling on a single machine with linear deteriorating processing times and delivery times, Online economic ordering problem for deteriorating items with limited price information, Improved analysis of online balanced clustering, Machine learning advised algorithms for the ski rental problem with a discount, Randomized strategies for non-additive 3-slope ski rental, Priority algorithms for makespan minimization in the subset model., More on random walks, electrical networks, and the harmonic \(k\)-server algorithm., Off-line temporary tasks assignment., The 3-server problem in the plane., Two short notes on the on-line travelling salesman: handling times and lookahead., On randomization in on-line computation., Online variable sized covering, A general decomposition theorem for the \(k\)-server problem, An application of deterministic and robust optimization in the wood cutting industry, Generalized Canadian traveller problems, The online \(k\)-server problem with max-distance objective, \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm, On online algorithms with advice for the \(k\)-server problem, Advice complexity of maximum independent set in sparse and bipartite graphs, Non-additive two-option ski rental, Buffer management of multi-queue QoS switches with class segregation, Parameterized analysis of paging and list update algorithms, Asymptotically optimal online page migration on three points, The Bancomat problem: An example of resource allocation in a partitionable asynchronous system, Memoryless algorithms for the generalized k-server problem on uniform metrics, General bounds for incremental maximization
