1 citations · 1 across the 7 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DS2024
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…
cs.DS2024
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…
cs.DS2024
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…