1 citations · 2 across the 4 of their papers we have counts for
4 papers
Computing Euclidean k-Center over Sliding Windows
Sang-Sub Kim
In the Euclidean -center problem in sliding window model, input points are given in a data stream and the goal is to find the smallest congruent balls whose union covers the…
Geometric Firefighting in the Half-plane
Sang-Sub Kim, Rolf Klein, David Kübel +2
In 2006, Alberto Bressan suggested the following problem. Suppose a circular fire spreads in the Euclidean plane at unit speed. The task is to build, in real time, barrier curves t…
Covering and Piercing Disks with Two Centers
Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer +3
We give exact and approximation algorithms for two-center problems when the input is a set of disks in the plane. We first study the problem of finding two smallest c…
Covering Points by Disjoint Boxes with Outliers
Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine +5
For a set of n points in the plane, we consider the axis--aligned (p,k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain n-k points. In this…