An Efficient Algorithm for Maximum Trajectory Coverage Query With Approximation Guarantee-Reference-Cited by-同舟云学术

An Efficient Algorithm for Maximum Trajectory Coverage Query With Approximation Guarantee

Published:2022-12 Issue:12 Volume:23 Page:24031-24043
ISSN:1524-9050
Container-title:IEEE Transactions on Intelligent Transportation Systems
language:
Short-container-title:IEEE Trans. Intell. Transport. Syst.

Author:

He Dan¹^ORCID,Zhou Thomas²,Zhou Xiaofang³^ORCID,Kim Jiwon¹^ORCID

Affiliation:

1. Faculty of Engineering, Architecture, and Information Technology, The University of Queensland, Brisbane, QLD, Australia

2. Department of Computer Science, ETH Zürich, Zürich, Switzerland

3. Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong

Funder

Hong Kong Research Grants Council

Jockey Club (JC) Science, Technology, Engineering, and Mathematics (STEM) Lab of Data Science Foundations funded by the Hong Kong Jockey Club Charities Trust

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Computer Science Applications,Mechanical Engineering,Automotive Engineering

Link

http://xplorestaging.ieee.org/ielx7/6979/9972869/09905740.pdf?arnumber=9905740

Reference31 articles.

1. Time-Dependent Urban Customized Bus Routing With Path Flexibility

2. A two-phase optimization model for the demand-responsive customized bus network design

3. Searching trajectories by locations

4. Retrieving k-Nearest Neighboring Trajectories by a Set of Point Locations

5. Efficient Point-Based Trajectory Search

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. AI Approaches on Urban Public Transport Routing;Wireless Networks;2024