Trajectory-driven Influential Billboard Placement
Ping Zhang (Wuhan University); Zhifeng Bao (RMIT University); Yuchen Li (Singapore Management University); Guoliang Li (Tsinghua University); Yipeng Zhang (RMIT University); Zhiyong Peng (Wuhan University)
In this paper we propose and study the problem of trajectory-driven influential billboard placement: given a set of billboards $\ur$ (each with a location and a cost), a database of trajectories $\td$ and a budget $\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 $(1-1/e)$ approximation ratio. However, the enumeration should be very costly when $|\ur|$ is large. By exploiting the locality property of billboards’ influence, we propose a partition-based framework \psel. \psel partitions $\ur$ into a set of small clusters, computes the locally influential billboards for each cluster, and merges them to generate the global solution. Since the local solutions can be obtained much more efficient than the global one, \psel should reduce the computation cost greatly; meanwhile it achieves a non-trivial approximation ratio guarantee. Then we propose a \bbsel method to further prune billboards with low marginal influence, while achieving the same approximation ratio as \psel. Experiments on real datasets verify the efficiency and effectiveness of our methods.
How can we assist you?
We'll be updating the website as information becomes available. If you have a question that requires immediate attention, please feel free to contact us. Thank you!
If you are experiencing any issue related to registrations (confirmation, payment problem etc.) or have any questions regarding registrations, please do not submit this form. Please send an email to Kelly Hughes (email@example.com) or call 1.888.526.1242 or 303.530.4683.
Please enter the word you see in the image below: