Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4030972
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation schemes for covering and packing problems in image processing and VLSI |
scientific article; zbMATH DE number 4030972 |
Statements
Approximation schemes for covering and packing problems in image processing and VLSI (English)
0 references
1985
0 references
covering points in the Euclidean space
0 references
image processing
0 references
VLSI
0 references
worst case analysis of heuristics
0 references
polynomial approximation schemes
0 references
strongly NP-complete problems
0 references
shifting strategy
0 references
packing
0 references
0 references
0 references
0 references
0 references
0.8151500821113586
0 references
0.7848542332649231
0 references
0.7780072689056396
0 references
0.7662783861160278
0 references
