Line segment disk cover

DOI10.1016/j.dam.2021.04.019OpenAlexW3157057800MaRDI QIDQ5919111

Manjanna Basappa

Publication date: 21 October 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.04.019

zbMATH Keywords

approximation schemegreedy approximation algorithmfixed-parameter-tractableline segment disk cover

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete geometry (52Cxx) Computing methodologies and applications (68Uxx)

Cites Work

• Unnamed Item
• Unit disk cover problem in 2D
• The within-strip discrete unit disk cover problem
• Improved results on geometric hitting set problems
• Covering a line segment with variable radius discs
• Almost optimal set covers in finite VC-dimension
• AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER
• Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
• ON THE DISCRETE UNIT DISK COVER PROBLEM
• Covering Points by Unit Disks of Fixed Location
• Covering segments with unit squares
• Line segment disk cover

This page was built for publication: Line segment disk cover