A matched approximation bound for the sum of a greedy coloring (Q1606980)
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 1771705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A matched approximation bound for the sum of a greedy coloring |
scientific article; zbMATH DE number 1771705 |
Statements
A matched approximation bound for the sum of a greedy coloring (English)
0 references
25 July 2002
0 references
minimum sum coloring problem
0 references
0.8074841499328613
0 references
0.8073385953903198
0 references
0.8068937063217163
0 references
0.8032297492027283
0 references
