Pages that link to "Item:Q2359789"

The following pages link to Polynomial-time approximation algorithms for the coloring problem in some cases (Q2359789):

Displaying 23 items.

• Almost optimal solutions for bin coloring problems (Q941831) (← links)
• Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
• The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← links)
• Deciding \(k\)-colorability in expected polynomial time (Q1847370) (← links)
• The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
• The intersection of two vertex coloring problems (Q2303434) (← links)
• Polynomial instances of the packing coloring problem (Q2840736) (← links)
• The Approximability of the Binary Paintshop Problem (Q2851858) (← links)
• Approximation Algorithms for Bounded Color Matchings via Convex Decompositions (Q2922649) (← links)
• (Q4401989) (← links)
• A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile (Q4680754) (← links)
• On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236) (← links)
• Algorithmic discrepancy beyond partial coloring (Q4978034) (← links)
• Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions (Q5090159) (← links)
• Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
• Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings (Q5302046) (← links)
• Graph-Theoretic Concepts in Computer Science (Q5710819) (← links)
• (Q5866345) (← links)
• (Q5875482) (← links)
• Algorithms and Computation (Q5897842) (← links)
• Faster graph coloring in polynomial space (Q5920158) (← links)
• Two generalizations of proper coloring: hardness and approximability (Q6168932) (← links)
• A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)