1 citations · 1 across the 7 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025★ 1 cited
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,…
cs.DS2025
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…