On the Maximum Edge Coloring Problem

DOI10.1007/978-3-540-93980-1_22zbMath1209.68649OpenAlexW1796361643MaRDI QIDQ3602848

Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos

Publication date: 12 February 2009

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-93980-1_22

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Approximating the max-edge-coloring problem

Cites Work

• Unnamed Item
• Unnamed Item
• Weighted coloring: further complexity and approximability results
• On the complexity of decomposing matrices arising in satellite communication
• Some results concerning the complexity of restricted colorings of graphs
• Scheduling a batching machine
• Scheduling in switching networks with set-up delays
• Restrictions and preassignments in preemptive open shop scheduling
• Batch processing with interval graph compatibilities between tasks
• The NP-Completeness of Edge-Coloring
• Regular Graphs of High Degree are 1-Factorizable
• Algorithms and Computation
• Automata, Languages and Programming
• On approximating a scheduling problem

This page was built for publication: On the Maximum Edge Coloring Problem