Pages that link to "Item:Q2921756"
From MaRDI portal
The following pages link to An asymptotic approximation scheme for multigraph edge coloring (Q2921756):
Displaying 12 items.
- Improving a family of approximation algorithms to edge color multigraphs (Q293395) (← links)
- On a local protocol for concurrent file transfers (Q487273) (← links)
- Approximating the chromatic index of multigraphs (Q630193) (← links)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- Approximating the maximum 2- and 3-edge-colorable subgraph problems (Q967422) (← links)
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture (Q968455) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- Approximating the maximum 3-edge-colorable subgraph problem (Q1043590) (← links)
- On the asymmetric representatives formulation for the vertex coloring problem (Q2482105) (← links)
- Asymptotics of the chromatic number for quasi-line graphs (Q3503489) (← links)
- An asymptotic approximation scheme for multigraph edge coloring (Q4962714) (← links)
- Efficiently list-edge coloring multigraphs asymptotically optimally (Q5146931) (← links)