Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102)
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: Exact algorithms and APX-hardness results for geometric packing and covering problems |
scientific article; zbMATH DE number 6249137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms and APX-hardness results for geometric packing and covering problems |
scientific article; zbMATH DE number 6249137 |
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
0 references
0.8354132771492004
0 references
0.8332311511039734
0 references
0.8163532018661499
0 references
0.8079138994216919
0 references
