3 citations · 6 across the 18 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
Gergely Csáji
We consider stable and popular matching problems in arbitrary graphs, which are referred to as stable roommates instances. We extend the 3/2-approximation algorithm for the maximum…
cs.DS2024
Approximating maximum-size properly colored forests
Yuhang Bai, Kristóf Bérczi, Gergely Csáji +1
In the Properly Colored Spanning Tree problem, we are given an edge-colored undirected graph and the goal is to find a properly colored spanning tree, i.e., a spanning tree in whic…