The deterministic competitive ratio of the Parking Permit Problem is exactly K; the randomized ratio is at most ln K + ln ln K + O(1) and at least ln K + ln ln K + o(1).
Title resolution pending
2 Pith papers cite this work, alongside 6 external citations. Polarity classification is still indexing.
2
Pith papers citing it
6
external citations · OpenAlex
fields
cs.DS 2years
2026 2representative citing papers
First learning-augmented algorithms for online minimization problems that use stable dual LP predictions to improve theoretical guarantees on metrical task systems and laminar set cover.
citing papers explorer
-
Primal-Dual Online Algorithms for the Parking Permit Problem
The deterministic competitive ratio of the Parking Permit Problem is exactly K; the randomized ratio is at most ln K + ln ln K + O(1) and at least ln K + ln ln K + o(1).
-
Learning-Augmented Online Minimization with Dual Predictions
First learning-augmented algorithms for online minimization problems that use stable dual LP predictions to improve theoretical guarantees on metrical task systems and laminar set cover.