Improved approximation algorithms for the max edge-coloring problem

DOI10.1016/J.IPL.2011.05.019MaRDI QIDQ1944142zbMATH OpenOpenAlexFDO

Authors G. Lucarelli, Ioannis Milis

Publication date 4 April 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2011.05.019

zbMATH Keywords

treesapproximation algorithmsbipartite and general graphsmax edge-coloring

Mathematics Subject Classification ID

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

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

Cites work

• An algorithmic proof of Tutte's f-factor theorem
• Approximating the max-edge-coloring problem
• Automata, Languages and Programming
• Batch processing with interval graph compatibilities between tasks
• Max-coloring paths: tight bounds and extensions
• On the max-weight edge coloring problem
• Restrictions and preassignments in preemptive open shop scheduling
• Some results concerning the complexity of restricted colorings of graphs
• Time slot scheduling of compatible jobs
• Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
• Weighted coloring: further complexity and approximability results

Cited in

(15)

• Improved Inapproximability Results for Maximum k-Colorable Subgraph
• On the Complexity of the Max-Edge-Coloring Problem with Its Variants
• Improved edge-coloring algorithms for planar graphs
• Approximation and Hardness Results for the Maximum Edge q-coloring Problem
• On the max coloring problem
• On the Maximum Edge Coloring Problem
• Approximating the max 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.
• Efficient algorithms for the edge-cover coloring problem
• Improved approximation algorithms for the max-edge coloring problem
• On the max-weight edge coloring problem
• The assignment problem with nearly Monge arrays and incompatible partner indices
• Bounded max-colorings of graphs
• 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 Q1944142)