An improved approximation algorithm for maximum edge 2-coloring in simple graphs (Q935838)
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: An improved approximation algorithm for maximum edge 2-coloring in simple graphs |
scientific article; zbMATH DE number 5309334
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved approximation algorithm for maximum edge 2-coloring in simple graphs |
scientific article; zbMATH DE number 5309334 |
Statements
An improved approximation algorithm for maximum edge 2-coloring in simple graphs (English)
0 references
8 August 2008
0 references
approximation algorithms
0 references
maximum edge \(t\)-coloring
0 references
maximum \(b\)-matching
0 references
randomization
0 references
derandomization
0 references
