On the Maximum Edge Coloring Problem

DOI10.1007/978-3-540-93980-1_22zbMATH Open1209.68649OpenAlexW1796361643MaRDI QIDQ3602848FDOQ3602848

Authors: G. 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

Recommendations

• On the max-weight edge coloring problem
• Approximating the max edge-coloring problem
• Approximating the max-edge-coloring problem
• On the Complexity of the Max-Edge-Coloring Problem with Its Variants
• Maximal edge-colorings of graphs
• scientific article; zbMATH DE number 1947051
• Maximum edge-colorings of graphs
• Approximation Algorithms for Maximum Edge Coloring Problem
• Improved approximation algorithms for the max edge-coloring problem
• Improved approximation algorithms for the max-edge coloring problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• A note on compact and compact circular edge-colorings of graphs
• Title not available (Why is that?)
• On the Complexity of the Max-Edge-Coloring Problem with Its Variants
• Generalized edge-colorings of weighted graphs
• Bounded max-colorings of graphs
• On weighted bipartite edge coloring
• On the max-weight edge coloring problem
• Some maximum multigraphs and adge/vertex distance colourings
• Approximating the max-edge-coloring problem
• Title not available (Why is that?)
• Improved approximation algorithms for the max edge-coloring problem
• Approximating the max edge-coloring problem
• Improved approximation algorithms for the max-edge coloring problem

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

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