An improved approximation algorithm for maximum edge 2-coloring in simple graphs
type: Item
instance of: scholarly article
title: An improved approximation algorithm for maximum edge 2-coloring in simple graphs
zbMATH Open document ID: 1146.68071
author: Zhi-Zhong Chen
author: Ruka Tanahashi
author: Lusheng Wang
published in: Journal of Discrete Algorithms
publication date: 2008-08-08T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 5309334
zbMATH Keywords: approximation algorithms
zbMATH Keywords: maximum edge \(t\)-coloring
zbMATH Keywords: maximum \(b\)-matching
zbMATH Keywords: randomization
zbMATH Keywords: derandomization
MaRDI profile type: Publication
full work available at URL: j.jda.2007.08.002
OpenAlex ID: W2099431183
cites work: Q4411281
cites work: Complexity of Recognizing Equal Unions in Families of Sets
cites work: Path factors in cubic graphs
cites work: An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
cites work: Q3799261
cites work: Q4945523
DOI: 10.1016/J.JDA.2007.08.002
description: scientific article; zbMATH DE number 5309334