Showing cs.CGShow all
2 papers · 1 filter
cs.CG2023
A 2-Approximation Algorithm for Data-Distributed Metric k-Center
Sepideh Aghamolaei, Mohammad Ghodsi
In a metric space, a set of point sets of roughly the same size and an integer are given as the input and the goal of data-distributed -center is to find a subset of s…
cs.CG2023
A Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem
Sepideh Aghamolaei, Mohammad Ghodsi
Sublinear time complexity is required by the massively parallel computation (MPC) model. Breaking dynamic programs into a set of sparse dynamic programs that can be divided, solved…