1 citations · 1 across the 1 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
Salwa Faour, Fabian Kuhn
The maximum independent set problem is a classic optimization problem that has also been studied quite intensively in the distributed setting. While the problem is hard to approxim…
cs.DS2022★ 1 cited
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond
Salwa Faour, Mohsen Ghaffari, Christoph Grunau +2
We develop a general deterministic distributed method for locally rounding fractional solutions of graph problems for which the analysis can be broken down into analyzing pairs of…
cs.DS2020
Approximate Bipartite Vertex Cover in the CONGEST Model
Salwa Faour, Fabian Kuhn
We give efficient distributed algorithms for the minimum vertex cover problem in bipartite graphs in the CONGEST model. From Kőnig's theorem, it is well known that in bipartite gra…