Online matching with its applications to ridesharing
This thesis studies an online matching problem with its applications to ridesharing. Matching is a well-known problem with a long history and significant impact on both theoretical computer science and practice. Ridesharing is a new service that connects passengers and drivers with available vehi...
Main Author: | Wang, Hao |
---|---|
Other Authors: | Bei Xiaohui |
Format: | Thesis-Doctor of Philosophy |
Language: | English |
Published: |
Nanyang Technological University
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/155387 |
Similar Items
-
Budget efficient online active learning and its applications
by: Hao, Shuji
Published: (2017) -
Automatic image matching and applications
by: Singhal, Aseem.
Published: (2009) -
Fast computation of clustered many-to-many shortest paths and its application to map matching
by: Jagadeesh, George Rosario, et al.
Published: (2020) -
Matching-constrained active contours with affine-invariant shape prior
by: Yeung, Sai-Kit, et al.
Published: (2015) -
Server allocation for massively multiplayer online cloud games
by: Zhao, Meiqi
Published: (2022)