Pages that link to "Item:Q1321829"
From MaRDI portal
The following pages link to Approximation results for the minimum graph coloring problem (Q1321829):
Displaying 11 items.
- Differential approximation algorithm of FSMVRP (Q277103) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- New differential approximation algorithm for \(k\)-customer vehicle routing problem (Q976133) (← links)
- Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
- Maximizing the number of unused colors in the vertex coloring problem (Q1336741) (← links)
- The maximum saving partition problem (Q1779697) (← links)
- Three-quarter approximation for the number of unused colors in graph coloring (Q1818979) (← links)
- Approximating k-set cover and complementary graph coloring (Q4645918) (← links)
- Dual parameterization of Weighted Coloring (Q5009474) (← links)
