11 citations · 27 across the 9 of their papers we have counts for
4 papers · 1 filter
When Hashing Met Matching: Efficient Spatio-Temporal Search for Ridesharing
Chinmoy Dutta
Carpooling, or sharing a ride with other passengers, holds immense potential for urban transportation. Ridesharing platforms enable such sharing of rides using real-time data. Find…
Maximum Weight Online Matching with Deadlines
Itai Ashlagi, Maximilien Burq, Chinmoy Dutta +3
We study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace.…
Online Matching in a Ride-Sharing Platform
Chinmoy Dutta, Chris Sholley
We propose a formal graph-theoretic model for studying the problem of matching rides online in a ride-sharing platform. Unlike most of the literature on online matching, our model,…
On Strong Graph Partitions and Universal Steiner Trees
Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan +2
We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph and a root node , we seek a single spanning tree of minimum {\em stretc…