1 citations · 1 across the 5 of their papers we have counts for
4 papers · 1 filter
Approximate Distance and Shortest-Path Oracles for Fault-Tolerant Geometric Spanners
Kyungjin Cho, Jihun Shin, Eunjin Oh
In this paper, we present approximate distance and shortest-path oracles for fault-tolerant Euclidean spanners motivated by the routing problem in real-world road networks. An -…
Faster Algorithms for Cycle Hitting Problems on Disk Graphs
Shinwoo An, Kyungjin Cho, Eunjin Oh
In this paper, we consider three hitting problems on a disk intersection graph: Triangle Hitting Set, Feedback Vertex Set, and Odd Cycle Transversal. Given a disk intersection grap…
Linear-Time Approximation Scheme for k-Means Clustering of Affine Subspaces
Kyungjin Cho, Eunjin Oh
In this paper, we present a linear-time approximation scheme for -means clustering of \emph{incomplete} data points in -dimensional Euclidean space. An \emph{incomplete} data…
Optimal Algorithm for the Planar Two-Center Problem
Kyungjin Cho, Eunjin Oh, Haitao Wang +1
We study a fundamental problem in Computational Geometry, the planar two-center problem. In this problem, the input is a set of points in the plane and the goal is to find…