Fast approximation algorithms for a nonconvex covering problem (Q3776651): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:47, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast approximation algorithms for a nonconvex covering problem |
scientific article |
Statements
Fast approximation algorithms for a nonconvex covering problem (English)
0 references
1987
0 references
approximation schemes
0 references
minimal coverings by nonconvex objects
0 references
motion planning
0 references
robots
0 references
strongly NP-complete
0 references
