Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:25, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact algorithms and APX-hardness results for geometric packing and covering problems |
scientific article |
Statements
Exact algorithms and APX-hardness results for geometric packing and covering problems (English)
0 references
22 January 2014
0 references
geometric set cover
0 references
geometric packing
0 references
geometric hitting set
0 references
APX-hardness
0 references
dynamic programming
0 references
