Approximating the max edge-coloring problem

DOI10.1007/978-3-642-10217-2_11MaRDI QIDQ3651536zbMATH OpenOpenAlexFDO

Authors Nicolas Bourgeois, G. Lucarelli, Ioannis Milis, Vangelis Th. Paschos

Publication date 11 December 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10217-2_11

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• Improved approximation algorithms for the max-edge coloring problem
• Improved approximation algorithms for the max edge-coloring problem
• On the max-weight edge coloring problem
• Approximating the max-edge-coloring problem
• On the Maximum Edge Coloring Problem

Cited in

(12)

• Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
• On approximate graph colouring and MAX-k-CUT algorithms based on the -function
• Improved approximation algorithms for the max edge-coloring problem
• Improved approximation algorithms for the max-edge coloring problem
• Approximation and Hardness Results for the Maximum Edge q-coloring Problem
• Approximation and hardness results for the maximum edge q-coloring problem
• On the Maximum Edge Coloring Problem
• Optimal edge coloring of large graphs
• An asymptotic approximation scheme for multigraph edge coloring
• scientific article; zbMATH DE number 6469191 (Why is no real title available?)
• On the max-weight edge coloring problem
• Approximating the max-edge-coloring problem

This page was built for publication: Approximating the max edge-coloring problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3651536)