Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Gu, Qian"'
Autor:
Gu, Qian-Ping, Liang, Jiajian Leo
Mobility-on-demand (MoD) ridesharing is a promising way to improve the occupancy rate of personal vehicles and reduce traffic congestion and emissions. Maximizing the number of passengers served and maximizing a profit target are major optimization g
Externí odkaz:
http://arxiv.org/abs/2310.04933
Autor:
Gu, Qian-Ping, Liang, Jiajian Leo
The potential of integrating public transit with ridesharing includes shorter travel time for commuters and higher occupancy rate of personal vehicles and public transit ridership. In this paper, we describe a centralized transit system that integrat
Externí odkaz:
http://arxiv.org/abs/2308.09191
Autor:
Gu, Qian-Ping, Liang, Jiajian Leo
Many public transportation systems are unable to keep up with growing passenger demand as the population grows in urban areas. The slow or lack of improvements for public transportation pushes people to use private transportation modes, such as carpo
Externí odkaz:
http://arxiv.org/abs/2106.00232
Publikováno v:
Theoretical Computer Science, Volume 871, 6 June 2021, Pages 30-50
The ridesharing problem is that given a set of trips, each trip consists of an individual, a vehicle of the individual and some requirements, select a subset of trips and use the vehicles of selected trips to deliver all individuals to their destinat
Externí odkaz:
http://arxiv.org/abs/2007.15154
Traffic forecasting has recently attracted increasing interest due to the popularity of online navigation services, ridesharing and smart city projects. Owing to the non-stationary nature of road traffic, forecasting accuracy is fundamentally limited
Externí odkaz:
http://arxiv.org/abs/2006.12715
Autor:
Gu, Qian-Ping, Xu, Gengchun
We give a $(1+\epsilon)$-approximate distance oracle with $O(1)$ query time for an undirected planar graph $G$ with $n$ vertices and non-negative edge lengths. For $\epsilon>0$ and any two vertices $u$ and $v$ in $G$, our oracle gives a distance $\ti
Externí odkaz:
http://arxiv.org/abs/1706.03108
Autor:
Gu, Qian-Ping, Xu, Gengchun
We give an algorithm which for an input planar graph $G$ of $n$ vertices and integer $k$, in $\min\{O(n\log^3n),O(nk^2)\}$ time either constructs a branch-decomposition of $G$ with width at most $(2+\delta)k$, $\delta>0$ is a constant, or a $(k+1)\ti
Externí odkaz:
http://arxiv.org/abs/1407.6761
Publikováno v:
Nano Letters (2003).
We report a simple and reproducible method to fabricate two metallic electrodes made of different metals with a nanometer-sized gap. These electrodes are fabricated by defining a pair of gold electrodes lithographically and electrodepositing a second
Externí odkaz:
http://arxiv.org/abs/cond-mat/0309359