Pages that link to "Item:Q1944142"
From MaRDI portal
The following pages link to Improved approximation algorithms for the max edge-coloring problem (Q1944142):
Displaying 13 items.
- The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
- Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721) (← links)
- On the max-weight edge coloring problem (Q613668) (← links)
- Analysis of approximate algorithms for edge-coloring bipartite graphs (Q673614) (← links)
- On the max coloring problem (Q690449) (← links)
- Approximating the max-edge-coloring problem (Q986540) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. (Q2768314) (← links)
- Approximation and Hardness Results for the Maximum Edge q-coloring Problem (Q3060768) (← links)
- Improved edge-coloring algorithms for planar graphs (Q3495664) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- Improved Inapproximability Results for Maximum k-Colorable Subgraph (Q3638876) (← links)
- Efficient algorithms for the edge-cover coloring problem (Q5063668) (← links)