Pages that link to "Item:Q5471049"

The following pages link to MAX <i>k</i>‐CUT and approximating the chromatic number of random graphs (Q5471049):

Displaying 13 items.

• An improved algorithm for approximating the chromatic number of \(G_{n,p}\) (Q845732) (← links)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
• On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function (Q1888168) (← links)
• On the maximal cut in a random hypergraph (Q2121837) (← links)
• A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
• Typical performance of approximation algorithms for NP-hard problems (Q3302475) (← links)
• Approximability Distance in the Space of H-Colourability Problems (Q3392945) (← links)
• Approximate graph coloring by semidefinite programming (Q3841651) (← links)
• (Q5743397) (← links)
• The Ising Antiferromagnet and Max Cut on Random Regular Graphs (Q5864219) (← links)
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900936) (← links)
• MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems (Q6053474) (← links)