The coverage problem by aligned disks

DOI10.1007/978-3-030-89543-3_19MaRDI QIDQ2695288zbMATH OpenOpenAlexFDO

Authors Shin-Ichi Nakano

Publication date 30 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-89543-3_19

zbMATH Keywords

algorithmdisk coverage problem

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• scientific article; zbMATH DE number 1115549 (Why is no real title available?)
• A note on minimum-sum coverage by aligned disks
• Efficient algorithms for the one-dimensional \(k\)-center problem
• Improved complexity bounds for location problems on the real line
• Introduction to algorithms.
• Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
• Minimum-cost coverage of point sets by disks
• New Results on the Complexity of p-Centre Problems
• New algorithms for facility location problems on the real line
• On the Complexity of Some Common Geometric Location Problems
• Polynomial time approximation schemes for base station coverage with minimum total radii
• Some variations on constrained minimum enclosing circle problem
• THE ALIGNED K-CENTER PROBLEM

Cited in

(7)

• Seek distances in disks with two independent heads per surface
• Algorithms for the line-constrained disk coverage and related problems
• Algorithms for the line-constrained disk coverage and related problems
• A note on minimum-sum coverage by aligned disks
• The K-prize-collecting coverage problem by aligned disks
• The bound coverage problem by aligned disks in \(L_1\) metric
• The within-strip discrete unit disk cover problem

This page was built for publication: The coverage problem by aligned disks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695288)