Pages that link to "Item:Q1209311"

The following pages link to A still better performance guarantee for approximate graph coloring (Q1209311):

Displaying 30 items.

• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• On the chromatic number of non-sparse random intersection graphs (Q519889) (← links)
• Minimum clique partition in unit disk graphs (Q659693) (← links)
• Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability (Q730503) (← links)
• Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) (← links)
• Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
• Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
• Partition into cliques for cubic graphs: Planar case, complexity and approximation (Q947111) (← links)
• Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
• Priority algorithms for graph optimization problems (Q1041242) (← links)
• All structured programs have small tree width and good register allocation (Q1271620) (← links)
• Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
• Zero knowledge and the chromatic number (Q1276168) (← links)
• Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
• Approximating the independence number via the \(\vartheta\)-function (Q1380939) (← links)
• Heuristics for semirandom graph problems (Q1604213) (← links)
• Non-clairvoyant scheduling with conflicts for unit-size jobs (Q1721929) (← links)
• Towards optimal lower bounds for clique and chromatic number. (Q1874411) (← links)
• Flexible coloring (Q1944945) (← links)
• An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem (Q2460104) (← links)
• An ant-based algorithm for coloring graphs (Q2467354) (← links)
• On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
• From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
• Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring (Q2885476) (← links)
• Matrix-Free Convex Optimization Modeling (Q2957708) (← links)
• Approximating Independent Set and Coloring in Random Uniform Hypergraphs (Q3599156) (← links)
• On the greatest number of 2 and 3 colorings of a (v, e)-graph (Q3832593) (← links)
• Coloration de graphes : fondements et applications (Q4809665) (← links)
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
• “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)