Database Paper Browser

Back to papers

Online Ridesharing with Meeting Points

Summary: Formalizes MORP, a meeting-point-based ridesharing problem; NP-hard and lacks any polynomial-time constant-competitive algorithm. Proposes k-skip cover with HMPO graphs for candidate ranking and SMDB to solve MORP; experiments show efficiency. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12906
Venue
VLDB
Year
2022
Pagerank
4.1945683e-05
Overall Rank
11,413 | 20.61%
DOI
10.14778/3565838.3565849

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
9,679 Real-time Insertion Operator for Shared Mobility on Time-Dependent Road Networks 2024 VLDB 4.3047774e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
498 Large Scale Real-time Ridesharing with Service Guarantee on Road Networks 2014 VLDB 0.00021678756
1,054 On k-skip Shortest Paths 2011 SIGMOD 0.00014422699
2,332 Order Dispatch in Price-aware Ridesharing 2018 VLDB 9.0171784e-05
2,520 A Unified Approach to Route Planning for Shared Mobility 2018 VLDB 8.6069685e-05
2,766 On k-Path Covers and their Applications 2014 VLDB 8.1526804e-05
6,743 Utility-Aware Ridesharing on Road Networks 2017 SIGMOD 4.9430196e-05
11,794 Flexible Online Task Assignment in Real-Time Spatial Data 2017 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers