Approximation algorithm for maximum edge coloring

DOI10.1016/J.TCS.2008.10.035zbMATH Open1162.68043OpenAlexW2010526719MaRDI QIDQ1007243FDOQ1007243

Hanpin Wang, Li'ang Zhang, Wangsen Feng

Publication date: 20 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.035

Recommendations

• Approximation Algorithms for Maximum Edge Coloring Problem
• The min-max edge \(q\)-coloring problem
• The min-max edge \(q\)-coloring problem
• scientific article; zbMATH DE number 1947051
• scientific article; zbMATH DE number 3889546

zbMATH Keywords

approximation algorithmwireless mesh networksmaximum edge coloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Matching, Euler tours and the Chinese postman
• The NP-Completeness of Edge-Coloring
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Short Proof of the Factor Theorem for Finite Graphs
• The Factors of Graphs
• Almost all k-colorable graphs are easy to color
• The Complexity of Near-Optimal Graph Coloring

Cited In (12)

• Complexity of Computing the Anti-Ramsey Numbers for Paths.
• Approximating maximum edge 2-coloring by normalizing graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks
• Efficient algorithms for the edge-cover coloring problem
• On \(\mathrm{M}_f\)-edge colorings of graphs
• Improved approximation for maximum edge colouring problem
• New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring
• Approximation and hardness results for the maximum edge \(q\)-coloring problem
• Approximation Algorithms for Maximum Edge Coloring Problem
• Optimal edge coloring of large graphs

This page was built for publication: Approximation algorithm for maximum edge coloring

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