Pages that link to "Item:Q1336741"
From MaRDI portal
The following pages link to Maximizing the number of unused colors in the vertex coloring problem (Q1336741):
Displaying 11 items.
- Dual parameterization of weighted coloring (Q786042) (← links)
- Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- The maximum saving partition problem (Q1779697) (← links)
- Three-quarter approximation for the number of unused colors in graph coloring (Q1818979) (← links)
- A new vertex coloring heuristic and corresponding chromatic number (Q2196603) (← links)
- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (Q2971609) (← links)
- Approximating k-set cover and complementary graph coloring (Q4645918) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
- Dual parameterization of Weighted Coloring (Q5009474) (← links)
- (Q5501309) (← links)