Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces? (Q2025288): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: QCQP / rank | |||
Normal rank | |||
Revision as of 09:24, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces? |
scientific article |
Statements
Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces? (English)
0 references
11 May 2021
0 references
ball covering problem
0 references
nonconvex quadratically constrained quadratic programming
0 references
computational geometry
0 references
Voronoi-like polyhedron
0 references
vertex enumeration
0 references
polynomial time complexity
0 references
