Unit disk cover problem in 2D
type: Item
instance of: scholarly article
title: Unit disk cover problem in 2D
zbMATH Open document ID: 1337.68264
author: Manjanna Basappa
author: Rashmisnata Acharyya
author: Gautam K. Das
published in: Journal of Discrete Algorithms
publication date: 2015-08-18T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 52C15
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6473431
zbMATH Keywords: discrete unit disk cover
zbMATH Keywords: approximation algorithm
zbMATH Keywords: computational geometry
MaRDI profile type: Publication
full work available at URL: j.jda.2015.05.002
OpenAlex ID: W1546096012
cites work: Exact and approximation algorithms for clustering
cites work: Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
cites work: Almost optimal set covers in finite VC-dimension
cites work: Q4778553
cites work: AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER
cites work: Covering Points by Unit Disks of Fixed Location
cites work: Homogeneous 2-hop broadcast in 2D
cites work: ON THE DISCRETE UNIT DISK COVER PROBLEM
cites work: Optimal packing and covering in the plane are NP-complete
cites work: Q4198056
cites work: The searching over separators strategy to solve some NP-hard problems in subexponential time
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: Improved results on geometric hitting set problems
DOI: 10.1016/J.JDA.2015.05.002
description: scientific article; zbMATH DE number 6473431