Approximating minimum coloring and maximum independent set in dotted interval graphs (Q844151)
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: Approximating minimum coloring and maximum independent set in dotted interval graphs |
scientific article; zbMATH DE number 5659898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating minimum coloring and maximum independent set in dotted interval graphs |
scientific article; zbMATH DE number 5659898 |
Statements
Approximating minimum coloring and maximum independent set in dotted interval graphs (English)
0 references
18 January 2010
0 references
approximation algorithms
0 references
dotted interval graph
0 references
intersection graph
0 references
minimum coloring
0 references
maximum independent set
0 references
microsatellite genotyping
0 references
0 references
0.9078212976455688
0 references
0.9039427638053894
0 references
0.8963708281517029
0 references
0.8367468118667603
0 references
0.8324839472770691
0 references
