Online computation and competitive analysis
Online computation and competitive analysis
On-line single-server dial-a-ride problems
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
News from the online traveling repairman
Theoretical Computer Science - Mathematical foundations of computer science
The Online TSP Against Fair Adversaries
INFORMS Journal on Computing
Maximizing job completions online
Journal of Algorithms
On-Line Algorithms for the Dynamic Traveling Repair Problem
Journal of Scheduling
Online traveling salesman problem with deadline and advanced information
Computers and Industrial Engineering
Hi-index | 0.00 |
In the classical whack-a-mole game moles that pop up at certain locations must be whacked by means of a hammer before they go under ground again. The goal is to maximize the number of moles whacked. This problem can be formulated as an online optimization problem: requests (moles) appear over time at points in a metric space and must be served (whacked) by a server (hammer) before their deadlines (i.e., before they disappear). An online algorithm learns each request only at its release time and must base its decisions on incomplete information. We study the online whack-a-mole problem (WHAM) on the real line and on the uniform metric space. While on the line no deterministic algorithm can achieve a constant competitive ratio, we provide competitive algorithms for the uniform metric space. Our online investigations are complemented by complexity results for the offline problem.