3 papers
cs.DS2026
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…
cs.DS2026
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.DS2025
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,…