A generic conversion turns offline local search algorithms into online stochastic combinatorial bandit algorithms with O(log^3 T) approximate regret.
A 1.875: approximation algorithm for the stable marriage problem
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
background 1representative citing papers
The paper defines FO Cost-Value Decision for token-sliding discovery and proves FPT and W[1]-hardness results for Partial Vertex Cover Discovery across various graph classes.
Introduces approximation-preserving coresets that guarantee cost preservation for near-optimal solutions and proves that even tiny approximation-factor distortion forbids coresets of that size.
citing papers explorer
-
Offline Local Search for Online Stochastic Bandits
A generic conversion turns offline local search algorithms into online stochastic combinatorial bandit algorithms with O(log^3 T) approximate regret.
-
FO Value Discovery and Partial Vertex Cover Discovery
The paper defines FO Cost-Value Decision for token-sliding discovery and proves FPT and W[1]-hardness results for Partial Vertex Cover Discovery across various graph classes.
-
Approximation Preserving Coresets
Introduces approximation-preserving coresets that guarantee cost preservation for near-optimal solutions and proves that even tiny approximation-factor distortion forbids coresets of that size.