An exact algorithm for a class of geometric set-cover problems
type: Item
instance of: scholarly article
title: An exact algorithm for a class of geometric set-cover problems
zbMATH Open document ID: 1469.90121
author: Claudio Contardo
author: Alain Hertz
published in: Discrete Applied Mathematics
publication date: 2021-06-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7355836
zbMATH Keywords: geometric set-cover
zbMATH Keywords: Laguerre-Voronoi diagram
zbMATH Keywords: exact algorithm
MaRDI profile type: Publication
full work available at URL: j.dam.2021.05.005
OpenAlex ID: W3163918205
cites work: A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
cites work: Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
cites work: Unit disk cover problem in 2D
cites work: Approximation algorithms for the unit disk cover problem in 2D and 3D
cites work: The Continuous-Time Service Network Design Problem
cites work: Covering Points by Unit Disks of Fixed Location
cites work: Exact algorithms and APX-hardness results for geometric packing and covering problems
cites work: AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER
cites work: A scalable exact algorithm for the vertex \(p\)-center problem
cites work: ON THE DISCRETE UNIT DISK COVER PROBLEM
cites work: Optimal packing and covering in the plane are NP-complete
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry
cites work: Improved results on geometric hitting set problems
DOI: 10.1016/J.DAM.2021.05.005
description: scientific article; zbMATH DE number 7355836