Optimal packing and covering in the plane are NP-complete (Q1157170): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(81)90111-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013451793 / rank | |||
Normal rank | |||
Revision as of 19:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal packing and covering in the plane are NP-complete |
scientific article |
Statements
Optimal packing and covering in the plane are NP-complete (English)
0 references
1981
0 references
intersection graph
0 references
geometric algorithms
0 references
image processing
0 references
computer graphics
0 references
circuit layout
0 references
scheduling
0 references
