Pages that link to "Item:Q1321829"

The following pages link to Approximation results for the minimum graph coloring problem (Q1321829):

Displaying 23 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)
• Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
• Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
• Maximizing the number of unused colors in the vertex coloring problem (Q1336741) (← links)
• Polynomial approximation and graph-coloring (Q1404543) (← links)
• A matched approximation bound for the sum of a greedy coloring (Q1606980) (← links)
• The maximum saving partition problem (Q1779697) (← links)
• Three-quarter approximation for the number of unused colors in graph coloring (Q1818979) (← links)
• On the minimum load coloring problem (Q2466019) (← links)
• A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
• New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
• Approximating k-set cover and complementary graph coloring (Q4645918) (← links)
• (Q4782702) (← links)
• (Q4871063) (← links)
• Dual parameterization of Weighted Coloring (Q5009474) (← links)
• On the approximation of Min Split-coloring and Min Cocoloring (Q5301394) (← links)
• (Q5331780) (← links)
• (Q5875482) (← links)
• Graph-Theoretic Concepts in Computer Science (Q5902534) (← links)