6 papers
Improved Speed via Regional Fulfillment
Daniel Hathcock, R. Ravi, Amitabh Sinha
In e-retail, order fulfillment speed has become one of the most important metrics affecting customer satisfaction. While common wisdom dictates that maintaining a large global fulf…
Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
Daniel Hathcock, R. Ravi
Given a bipartite graph that has a perfect matching, a prefect proportional allocation is an assignment of positive weights to the nodes of the right partition so that every left n…
The Telephone -Multicast Problem
Daniel Hathcock, Guy Kortsarz, R. Ravi
We consider minimum time multicasting problems in directed and undirected graphs: given a root node and a subset of terminal nodes, multicasting seeks to find the minimum numbe…
The Steiner Path Aggregation Problem
Da Qi Chen, Daniel Hathcock, D Ellis Hershkowitz +1
In the Steiner Path Aggregation Problem, our goal is to aggregate paths in a directed network into a single arborescence without significantly disrupting the paths. In particular,…
The Online Submodular Assignment Problem
Daniel Hathcock, Billy Jin, Kalen Patton +2
Online resource allocation is a rich and varied field. One of the most well-known problems in this area is online bipartite matching, introduced in 1990 by Karp, Vazirani, and Vazi…
The Online Submodular Assignment Problem
Daniel Hathcock, Billy Jin, Kalen Patton +2
Online resource allocation is a rich and varied field. One of the most well-known problems in this area is online bipartite matching, introduced in 1990 by Karp, Vazirani, and Vazi…