Database Paper Browser

Back to papers

Utility-Aware Ridesharing on Road Networks

Summary: URR maximizes rider utility in road-network ridesharing under spatial-temporal and capacity constraints while preserving existing vehicle schedules. NP-hard; unlikely to admit a constant-factor approximation; proposes three approximations—bilateral arrangement, greedy, grouping-based scheduling—with experimental validation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5385
Venue
SIGMOD
Year
2017
Pagerank
4.9382759e-05
Overall Rank
6,744 | 53.13%
DOI
10.1145/3035918.3064008

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 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.0002165768
1,052 On k-skip Shortest Paths 2011 SIGMOD 0.00014403922
1,235 Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions 2011 VLDB 0.0001311113
2,773 On k-Path Covers and their Applications 2014 VLDB 8.1447894e-05
Previous Page 1 / 1 Next

Semantically Similar Papers