Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (Q6203477)
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: Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs |
scientific article; zbMATH DE number 7810343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs |
scientific article; zbMATH DE number 7810343 |
Statements
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (English)
0 references
28 February 2024
0 references
maximum weight independent set
0 references
hereditary graph classes
0 references
approximation scheme
0 references
three-in-a-tree
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
