Some approximation algorithms for the clique partition problem in weighted interval graphs (Q995565)
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: Some approximation algorithms for the clique partition problem in weighted interval graphs |
scientific article; zbMATH DE number 5186609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some approximation algorithms for the clique partition problem in weighted interval graphs |
scientific article; zbMATH DE number 5186609 |
Statements
Some approximation algorithms for the clique partition problem in weighted interval graphs (English)
0 references
3 September 2007
0 references
weighted interval graphs
0 references
cliques
0 references
approximation algorithms
0 references
0 references
0.9757103323936462
0 references
0.9092317223548888
0 references
0.8091692328453064
0 references
0.7935042381286621
0 references
0.7899608016014099
0 references
