An Efficient Algorithm for Maximum Trajectory Coverage Query With Approximation Guarantee

In this paper, we study the <inline-formula> <tex-math notation="LaTeX">k</tex-math> </inline-formula> Maximum Trajectory Coverage Query, which aims to find <inline-formula> <tex-math notation="LaTeX">k</tex-math> </inline-formula>...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on intelligent transportation systems Vol. 23; no. 12; pp. 1 - 13
Main Authors:	He, Dan, Zhou, Thomas, Zhou, Xiaofang, Kim, Jiwon
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.12.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Approximation Approximation algorithms check-in trajectory Greedy algorithms location-based applications Mathematical analysis maximum coverage Optimization Public transportation Route selection Spatial database Spatial databases STEM Trajectory Transportation systems Urban areas
ISSN:	1524-9050, 1558-0016
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!