Improved approximation algorithms for the max edge-coloring problem
type: Item
instance of: scholarly article
title: Improved approximation algorithms for the max edge-coloring problem
zbMATH Open document ID: 1260.05166
author: G. Lucarelli
author: Ioannis Milis
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6150446
zbMATH Keywords: approximation algorithms
zbMATH Keywords: max edge-coloring
zbMATH Keywords: trees
zbMATH Keywords: bipartite and general graphs
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.05.019
OpenAlex ID: W1544742712
cites work: An algorithmic proof of Tutte's f-factor theorem
cites work: Approximating the max-edge-coloring problem
cites work: Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
cites work: Restrictions and preassignments in preemptive open shop scheduling
cites work: Time slot scheduling of compatible jobs
cites work: Weighted coloring: further complexity and approximability results
cites work: Batch processing with interval graph compatibilities between tasks
cites work: Max-Coloring Paths: Tight Bounds and Extensions
cites work: Some results concerning the complexity of restricted colorings of graphs
cites work: On the max-weight edge coloring problem
cites work: Automata, Languages and Programming
DOI: 10.1016/J.IPL.2011.05.019
description: scientific article; zbMATH DE number 6150446