3 citations · 5 across the 10 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Exponential Lower Bounds for Integer-Weighted Shortest-Paths Preservers of DAGs
Michael Yi Wang, Nicole Wein
We study a graph simplification problem introduced by Bernstein, Bodwin, and Wein [ITCS'24]. We start with a graph with arbitrarily large positive edge weights and the goal is to r…
cs.DS2026
DAG Covers for Structured Graphs: The Steiner Point Effect
Sujoy Bhore, Hsien-Chih Chang, Jonathan Conroy +4
Given a weighted digraph , a -DAG cover is a collection of dominating DAGs such that all distances are approximately preserved: for every pair $(u,v…