Complexity and approximability of the happy set problem (Q2662689)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7333011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximability of the happy set problem |
scientific article; zbMATH DE number 7333011 |
Statements
Complexity and approximability of the happy set problem (English)
0 references
14 April 2021
0 references
maximum happy set problem
0 references
approximability
0 references
computational complexity
0 references
bipartite graphs
0 references
cubic graphs
0 references
block graphs
0 references
interval graphs
0 references
0 references
0 references
0.8813548684120178
0 references
0.8101524114608765
0 references
0.8093035221099854
0 references
0.8065724968910217
0 references
0.7922047972679138
0 references
