Pages that link to "Item:Q986540"
From MaRDI portal
The following pages link to Approximating the max-edge-coloring problem (Q986540):
Displaying 13 items.
- Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- On the max-weight edge coloring problem (Q613668) (← links)
- On the max coloring problem (Q690449) (← links)
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function (Q1888168) (← links)
- Improved approximation algorithms for the max edge-coloring problem (Q1944142) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- Approximation and Hardness Results for the Maximum Edge q-coloring Problem (Q3060768) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- Optimal edge coloring of large graphs (Q4262695) (← links)
- Approximating maximum edge coloring in multigraphs (Q4411281) (← links)
- An asymptotic approximation scheme for multigraph edge coloring (Q4962714) (← links)
- (Q5501309) (← links)