A note on minimum-sum coverage by aligned disks

DOI10.1016/j.ipl.2013.08.009zbMath1284.68617arXiv1202.4821OpenAlexW2049938325MaRDI QIDQ2445326

Chan-Su Shin

Publication date: 14 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.4821

zbMATH Keywords

computational geometrygeometric facility locationminimum-sum disk coverage

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)

Related Items (2)

The Coverage Problem by Aligned Disks ⋮ The coverage problem by aligned disks

Cites Work

• Unnamed Item
• Unnamed Item
• Connecting a set of circles with minimum sum of radii
• Two-Dimensional Voronoi Diagrams in the L _p -Metric

This page was built for publication: A note on minimum-sum coverage by aligned disks