Energy & materialsResearch findings
Mathematical Modeling of Tag-Specific Regret Minimization in Outdoor Advertising
Original published 2026.03.07 00:47 KSTAdded to Blackdeck 2026.10.21 08:04 KST
What has changed?
We formalize the tag-specific regret minimization problem as a combinatorial optimization problem and propose a fairness-aware greedy round-robin algorithm for
Key points
- Formalize tag-specific regret minimization as a combinatorial optimization problem
- Propose a fairness-aware greedy round-robin algorithm for balanced advertiser allocation
- Validate effectiveness and efficiency using real-world trajectory and billboard datasets
Connect it to your work
The Tag-specific Regret Minimization in Outdoor Advertising (TRMOA) is NP-hard and inapproximable within a constant factor
What remains unproven
This research note is based on an abstract; check the original for test conditions and application scope.
Originals used for this note
Links open the original publisher in a new tab.