10 citations · 18 across the 13 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
Finding Diverse Minimum s-t Cuts
Mark de Berg, Andrés López Martínez, Frits Spieksma
Recently, many studies have been devoted to finding diverse solutions in classical combinatorial problems, such as Vertex Cover (Baste et al., IJCAI'20), Matching (Fomin et al., IS…
cs.DS2023★ 2 cited
-Center Clustering with Outliers in the MPC and Streaming Model
Mark de Berg, Leyla Biabani, Morteza Monemizadeh
Given a point set of size in a metric space of doubling dimension and two parameters and , the -center problem with out…