Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056)
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: Minimum constellation covers: hardness, approximability and polynomial cases |
scientific article; zbMATH DE number 7347222
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum constellation covers: hardness, approximability and polynomial cases |
scientific article; zbMATH DE number 7347222 |
Statements
Minimum constellation covers: hardness, approximability and polynomial cases (English)
0 references
11 May 2021
0 references
exact graph cover
0 references
NP-hard
0 references
inapproximability
0 references
approximation algorithm
0 references
polynomial time algorithm
0 references
0 references
0 references
0.8899502
0 references
0 references
0.88387096
0 references
0.8803246
0 references
0.8735024
0 references
0.87153715
0 references
0.86881083
0 references
0.86560273
0 references
