Optimization problems in multiple subtree graphs (Q531599)
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: Optimization problems in multiple subtree graphs |
scientific article; zbMATH DE number 5880195
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimization problems in multiple subtree graphs |
scientific article; zbMATH DE number 5880195 |
Statements
Optimization problems in multiple subtree graphs (English)
0 references
19 April 2011
0 references
approximation algorithms
0 references
minimum dominating set
0 references
maximum independent set
0 references
minimum coloring
0 references
minimum vertex cover
0 references
maximum clique
0 references
multiple subtree graphs
0 references
0.9999997
0 references
0.9169601
0 references
0.9024652
0 references
0.9024652
0 references
0.88810456
0 references
0.8847397
0 references
0.8816184
0 references
