Computational complexity for the problem of optimal intersection of straight line segments by disks (Q2424188): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s0081543818090158 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2922045726 / rank | |||
Normal rank | |||
Latest revision as of 08:26, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity for the problem of optimal intersection of straight line segments by disks |
scientific article |
Statements
Computational complexity for the problem of optimal intersection of straight line segments by disks (English)
0 references
24 June 2019
0 references
computational complexity
0 references
hitting set problem
0 references
continuous disk cover problem
0 references
Delaunay triangulations
0 references
0 references
