Parallel algorithm for minimum partial dominating set in unit disk graph

DOI10.1007/978-3-030-92681-6_41OpenAlexW4205535753MaRDI QIDQ2150577

Weizhi Hong, Yingli Ran, Zhao Zhang

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_41

zbMATH Keywords

parallel algorithmapproximation ratiounit disk graphpartial dominating set

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connected dominating set. Theory and applications
• Unit disk cover problem in 2D
• On approximation problems related to the independent set and vertex cover problems
• Optimal packing and covering in the plane are NP-complete
• Unit disk graphs
• Covering a set of points in multidimensional space
• Parallel approximation for partial set cover
• A PTAS for the Weighted Unit Disk Cover Problem
• Approximation schemes for covering and packing problems in image processing and VLSI
• A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers
• NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
• Approximation algorithms for partial covering problems
• Analytical approach to parallel repetition
• ON THE DISCRETE UNIT DISK COVER PROBLEM
• Partial vs. Complete Domination: t-Dominating Set
• Approximation and Online Algorithms

This page was built for publication: Parallel algorithm for minimum partial dominating set in unit disk graph