33 citations · 122 across the 14 of their papers we have counts for
1 paper · 1 filter
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar +1
We consider the online carpooling problem: given n vertices, a sequence of edges arrive over time. When an edge et=(ut,vt) arrives at time step t, the algorithm must or…