Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102): 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/j.comgeo.2012.04.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2124937241 / rank | |||
Normal rank | |||
Revision as of 03:08, 20 March 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
