Improved approximation algorithms for the max-edge coloring problem

DOI10.1007/978-3-642-19754-3_21zbMATH Open1325.68257OpenAlexW2585720226MaRDI QIDQ2999347FDOQ2999347

Authors: G. Lucarelli, Ioannis Milis 

Publication date: 12 May 2011

Published in: Theory and Practice of Algorithms in (Computer) Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19754-3_21

Recommendations

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

Mathematics Subject Classification ID

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

Cited In (12)

• Improving the performance guarantee for approximate graph coloring
• Approximate constrained bipartite edge coloring
• Approximation and Hardness Results for the Maximum Edge q-coloring Problem
• On the Complexity of the Max-Edge-Coloring Problem with Its Variants
• Improved Inapproximability Results for Maximum k-Colorable Subgraph
• On the max-weight edge coloring problem
• Approximation and hardness results for the maximum edge \(q\)-coloring problem
• Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction.
• On the Maximum Edge Coloring Problem
• Approximating the max-edge-coloring problem
• Improved approximation algorithms for the max edge-coloring problem
• Approximating the max edge-coloring problem

This page was built for publication: Improved approximation algorithms for the max-edge coloring problem

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