Eunjin Oh

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

DAG Covers: The Steiner Point Effect

Sujoy Bhore, Hsien-Chih Chang, Jonathan Conroy +4

Given a weighted digraph $G$ , a $(t, g, I^¼)$ -DAG cover is a collection of $g$ dominating DAGs $D_{1}, \dots, D_{g}$ such that all distances are approximately preserved: for every pair $(u,…

cs.DS2025

Single-Source Shortest Path Problem in Weighted Disk Graphs

Shinwoo An, Eunjin Oh, Jie Xue

In this paper, we present efficient algorithms for the single-source shortest path problem in weighted disk graphs. A disk graph is the intersection graph of a family of disks in t…