Approximation hardness of domination problems on generalized convex graphs (Q6664063)
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: Approximation hardness of domination problems on generalized convex graphs |
scientific article; zbMATH DE number 7967956
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation hardness of domination problems on generalized convex graphs |
scientific article; zbMATH DE number 7967956 |
Statements
Approximation hardness of domination problems on generalized convex graphs (English)
0 references
16 January 2025
0 references
domination problem
0 references
tree-convex bipartite graph
0 references
approximation hardness
0 references
generalized convex graph
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7445438504219055
0 references
0.7301667332649231
0 references
0.7141274809837341
0 references
0.7140657901763916
0 references
0.7131280303001404
0 references
