Exact distributional analysis of online algorithms with lookahead

DOI10.1007/s10288-020-00442-1OpenAlexW3028289881MaRDI QIDQ2044551

Fabian Dunke, Stefan Nickel

Publication date: 9 August 2021

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-020-00442-1

zbMATH Keywords

online optimizationalgorithm analysislookaheaddistributional analysis

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online interval scheduling on a single machine with finite lookahead
• Scheduling unit length jobs on parallel machines with lookahead information
• On the relative dominance of paging algorithms
• On the power of lookahead in on-line server routing problems
• Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
• Online algorithms. The state of the art
• Competitive snoopy caching
• A competitive analysis of the list update problem with lookahead
• A Catalan triangle
• On competitive on-line paging with lookahead
• Dyck path enumeration
• A new measure for the study of on-line algorithms
• On the influence of lookahead in competitive paging algorithms
• Fast algorithms for bin packing
• Information Theory and Statistical Mechanics
• On Time Lookahead Algorithms for the Online Data Acknowledgement Problem
• Some Simple Applications of the Travelling Salesman Problem
• Beyond Competitive Analysis
• A Proof of Catalan's Convolution Formula
• Competitive algorithms for the on-line traveling salesman
• Online Bin Packing: Old Algorithms and New Results
• Paging and list update under bijective analysis
• Analysis 1.
• A survey of the Fine numbers