Improved approximation algorithms for the max edge-coloring problem (Q1944142)
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: Improved approximation algorithms for the max edge-coloring problem |
scientific article; zbMATH DE number 6150446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithms for the max edge-coloring problem |
scientific article; zbMATH DE number 6150446 |
Statements
Improved approximation algorithms for the max edge-coloring problem (English)
0 references
4 April 2013
0 references
approximation algorithms
0 references
max edge-coloring
0 references
trees
0 references
bipartite and general graphs
0 references
0.9919746518135072
0 references
0.9193243384361268
0 references
0.9132866859436036
0 references
0.8945566415786743
0 references
0.8930733799934387
0 references
