Optimal packing and covering in the plane are NP-complete (Q1157170)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal packing and covering in the plane are NP-complete |
scientific article; zbMATH DE number 3737031
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal packing and covering in the plane are NP-complete |
scientific article; zbMATH DE number 3737031 |
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
0 references
