NP-Hardness of the Problem of Optimal Box Positioning
We consider the problem of finding a position of a <i>d</i>-dimensional box with given edge lengths that maximizes the number of enclosed points of the given finite set <inline-formula> <math display="inline"> <semantics> <mrow> <mi>P</mi> &l...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-08-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/7/8/711 |