Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 52C45 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C39 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6249137 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
geometric set cover | |||
| Property / zbMATH Keywords: geometric set cover / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
geometric packing | |||
| Property / zbMATH Keywords: geometric packing / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
geometric hitting set | |||
| Property / zbMATH Keywords: geometric hitting set / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
APX-hardness | |||
| Property / zbMATH Keywords: APX-hardness / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
dynamic programming | |||
| Property / zbMATH Keywords: dynamic programming / rank | |||
Normal rank | |||
Revision as of 14:52, 29 June 2023
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
