Oct 6, 2022 · We present the first parallel algorithms for MinGPDS and MaxGBDS in unit disk graphs. They both run in rounds on machines, and achieve constant approximation ...
In this paper, we consider the minimum partial dominating set problem in unit disk graphs (MinPDS-UD). Given a set of points V on the plane with \(|V|=n\), ...
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph. https://doi.org/10.1016/j.tcs.2022.07 ...
Dec 17, 2021 · We present the first parallel algorithm for MinPDS-UD. It runs in rounds on O(n) machines, and achieves a constant approximation ratio.
Weizhi Hong, Yingli Ran, Zhao Zhang: Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph.
Abstract. We study partial and budgeted versions of the well studied connected dominating set problem. In the partial connected dominating set problem ...
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph. Weizhi Hong, Yingli Ran, Zhao Zhang.
A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs
www.researchgate.net › ... › Graphs
Aug 10, 2015 · We present a polynomial-time approximation scheme (PTAS) for the minimum dominating set problem in unit disk graphs.
Abstract. We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been.
Missing: Parallel partial budgeted
Jun 6, 2024 · Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph. Theoretical Computer ...