Get started
Keyword

deterministic online algorithms

Description: Algorithms that process input incrementally and make decisions without knowledge of future input, using no random choices.
OpenAlex ID: keywords/deterministic-online-algorithms
Better Bounds for Online Scheduling
1997 · Susanne Albers · SIAM Journal on Computing · 242
PDF
An optimal deterministic algorithm for online b-matching
2000 · Bala Kalyanasundaram, Kirk R. Pruhs · Theoretical Computer Science · 197
Online Primal-Dual Algorithms for Covering and Packing
2009 · Niv Buchbinder, Joseph (Seffi) Naor · Mathematics of Operations Research · 192
Online computation with advice
2010 · Yuval Emek, Pierre Fraigniaud, et al. · Theoretical Computer Science · 146
The online set cover problem
2003 · Noga Alon, Baruch Awerbuch, et al. · ACM Symposium on Theory of Computing (STOC) · 139
New Algorithms for an Ancient Scheduling Problem
1995 · Y. Bartal, A. Fiat, et al. · Journal of Computer and System Sciences · 122
On the Advice Complexity of Online Problems
2009 · Hans-Joachim Böckenhauer, Dennis Komm, et al. · Lecture notes in computer science · 120
The Online Set Cover Problem
2009 · Noga Alon, Baruch Awerbuch, et al. · SIAM Journal on Computing · 119
Online Scheduling with Bounded Migration
2004 · Peter Sanders, Naveen Sivadasan, et al. · Lecture notes in computer science · 111
PDF
Online energy generation scheduling for microgrids with intermittent energy sources and co-generation
2013 · Lian Lu, Jinlong Tu, et al. · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · 106
On the Bahncard Problem
1998 · Rudolf Fleischer · Lecture notes in computer science · 97
Competitive paging with locality of reference
1991 · Allan Borodin, Prabhakar Raghavan, et al. · ACM Symposium on Theory of Computing (STOC) · 85
PDF
Asymptotically optimal algorithm for online reconfiguration of edge-clouds
2016 · I-Hong Hou, Tao Zhao, et al. · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · 78
Scheduling with conflicts: online and offline algorithms
2008 · Guy Even, Magnús M. Halldórsson, et al. · Journal of Scheduling · 76
Speed is as powerful as clairvoyance [scheduling problems]
2002 · B. Kalyanasundaram, K. Pruhs · Annual Symposium on Foundations of Computer Science · 76
Improved Randomized On-Line Algorithms for the List Update Problem
1998 · Susanne Albers · SIAM Journal on Computing · 75
PDF
On the online unit clustering problem
2010 · Leah Epstein, Rob Van Stee · ACM Transactions on Algorithms · 53
A primal-dual algorithm for online non-uniform facility location
2006 · Dimitris Fotakis · Journal of Discrete Algorithms · 49
PDF
The online Prize-Collecting Traveling Salesman Problem
2008 · Giorgio Ausiello, Vincenzo Bonifaci, et al. · Information Processing Letters · 45
A competitive analysis of the list update problem with lookahead
1998 · Susanne Albers · Theoretical Computer Science · 44
An Adversarial Model for Scheduling with Testing
2020 · Christoph Dürr, Thomas Erlebach, et al. · Algorithmica · 43
PDF
On the Advice Complexity of the Knapsack Problem
2012 · Hans-Joachim Böckenhauer, Dennis Komm, et al. · Lecture notes in computer science · 42
Online Searching
2001 · Patrick Jaillet, Matthew Stafford · Operations Research · 39
On the performance of greedy algorithms in packet buffering
2004 · Susanne Albers, Markus Schmidt · ACM Symposium on Theory of Computing (STOC) · 33
Weighted Flow Time does not Admit O(1)-competitive Algorithms
2009 · Bansal, N Nikhil, Chan, HL · 32
Works count: 399
Citation count: 4,447
Year
Topic
Type