The coverage problem by aligned disks (Q2695288)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The coverage problem by aligned disks	scientific article

Statements

scholarly article

0 references

The coverage problem by aligned disks (English)

0 references

10.1007/978-3-030-89543-3_19

0 references

Shin-ichi Nakano

0 references

publication date

30 March 2023

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

algorithm

0 references

disk coverage problem

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-89543-3_19

0 references

0 references

0 references

0 references

THE ALIGNED K-CENTER PROBLEM

0 references

Efficient algorithms for the one-dimensional \(k\)-center problem

0 references

New algorithms for facility location problems on the real line

0 references

0 references

Improved complexity bounds for location problems on the real line

0 references

Some variations on constrained minimum enclosing circle problem

0 references

Polynomial time approximation schemes for base station coverage with minimum total radii

0 references

On the Complexity of Some Common Geometric Location Problems

0 references

New Results on the Complexity of <i>p</i>-Centre Problems

0 references

A note on minimum-sum coverage by aligned disks

0 references

Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2695288

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2695288&oldid=37503635"