Research map / Bandits and online learning / Online convex optimization and games
An Improved Algorithm for Online Min-Sum Set Cover
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Replace MAE's equal movement of all elements with moving the closest requested element and lazily accumulating movement budgets for the others | Online Min-Sum Set Cover · Dynamic OPT | competitive ratio: O(r^{3/2} \cdot \sqrt{n}) -> O(r^2) | Helped |
| Derandomize the randomized algorithm using the stated existence transformation | Lazy-Move-All-To-Front · Online Min-Sum Set Cover, dynamic OPT | competitive ratio: O(r^2) -> O(r^4) | Hurt |
Closest papers by meaning
- Sampling for Beyond-Worst-Case Online Ranking (AAAI 2024 · similarity 0.85)
- Approximation Algorithms for Preference Aggregation Using CP-Nets (AAAI 2024 · similarity 0.84)
- Online Fair Division Meets Reordering Buffers (NeurIPS 2026 · similarity 0.84)
- Selective Preference Aggregation (ICML 2025 · similarity 0.83)
- Ranking with Multiple Oracles: From Weak to Strong Stochastic Transitivity (ICML 2025 · similarity 0.83)
- Wait-Less Offline Tuning and Re-solving for Online Decision Making (ICML 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.