1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020★ 1 cited
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…