Yongho Shin

We develop learning-augmented algorithms for vertex-weighted and unweighted online bipartite fractional matching, with application to AdWords, and establish new robustness-consistency tradeoffs.

This paper presents improved algorithms for overlapping and robust clustering of edge-colored hypergraphs; our algorithms combine the strengths of LP with the efficiency of combinatorial algorithms, efficiently producing high-quality solutions.