The following pages link to (Q5875482):
Displaying 10 items.
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function (Q1888168) (← links)
- On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
- Improving the performance guarantee for approximate graph coloring (Q3763600) (← links)
- (Q4411283) (← links)
- (Q4736831) (← links)
- Algorithmic discrepancy beyond partial coloring (Q4978034) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- A generic framework for approximation analysis of greedy algorithms for star bicoloring (Q5085266) (← links)