4 citations · 4 across the 2 of their papers we have counts for
3 papers
cs.DS2021★ 4 cited
Making Three Out of Two: Three-Way Online Correlated Selection
Yongho Shin, Hyung-Chan An
Two-way online correlated selection (two-way OCS) is an online algorithm that, at each timestep, takes a pair of elements from the ground set and irrevocably chooses one of the two…
cs.DS2020
Online Graph Matching Problems with a Worst-Case Reassignment Budget
Yongho Shin, Kangsan Kim, Seungmin Lee +1
In the online bipartite matching with reassignments problem, an algorithm is initially given only one side of the vertex set of a bipartite graph; the vertices on the other side ar…
cs.DS2019
Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location Problems
Kangsan Kim, Yongho Shin, Hyung-Chan An
Facility location is a prominent optimization problem that has inspired a large quantity of both theoretical and practical studies in combinatorial optimization. Although the probl…