Trajectory-driven Influential Billboard Placement
Ping Zhang, Zhifeng Bao, Yuchen Li, Guoliang Li, Yipeng Zhang, Zhiyong, Peng

TL;DR
This paper addresses the complex problem of placing billboards to influence the maximum number of trajectories within a budget, proposing a scalable partition-based solution with strong approximation guarantees.
Contribution
It introduces PartSel, a partition-based framework leveraging locality to efficiently approximate optimal billboard placement, and proposes LazyProbe for further pruning.
Findings
PartSel significantly reduces computation time compared to enumeration.
The methods achieve high influence coverage within budget constraints.
Experimental results validate the efficiency and effectiveness of the proposed algorithms.
Abstract
In this paper we propose and study the problem of trajectory-driven influential billboard placement: given a set of billboards (each with a location and a cost), a database of trajectories and a budget , find a set of billboards within the budget to influence the largest number of trajectories. One core challenge is to identify and reduce the overlap of the influence from different billboards to the same trajectories, while keeping the budget constraint into consideration. We show that this problem is NP-hard and present an enumeration based algorithm with approximation ratio. However, the enumeration should be very costly when is large. By exploiting the locality property of billboards' influence, we propose a partition-based framework PartSel. PartSel partitions into a set of small clusters, computes the locally influential billboards for each…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
