Backwards greedy algorithms, processing feed slots from bottom to top, achieve a tight 2-approximation for the ad placement problem with decaying user attention, improving the prior practical 4-approximation.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficient and Practical Approximation Algorithms for Advertising in Content Feeds
Backwards greedy algorithms, processing feed slots from bottom to top, achieve a tight 2-approximation for the ad placement problem with decaying user attention, improving the prior practical 4-approximation.