Pages that link to "Item:Q1888168"

The following pages link to On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function (Q1888168):

Displayed 27 items.

• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) ‎ (← links)
• Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) ‎ (← links)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) ‎ (← links)
• The capacitated max \(k\)-cut problem (Q930343) ‎ (← links)
• Noise stability of functions with low influences: invariance and optimality (Q974039) ‎ (← links)
• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) ‎ (← links)
• Optimal pricing in iterative flexible combinatorial procurement auctions (Q1740561) ‎ (← links)
• Projection results for the \(k\)-partition problem (Q1751250) ‎ (← links)
• Maximally stable Gaussian partitions with discrete applications (Q1760364) ‎ (← links)
• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) ‎ (← links)
• A class of spectral bounds for max \(k\)-cut (Q2181211) ‎ (← links)
• A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) ‎ (← links)
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) ‎ (← links)
• A semidefinite programming-based heuristic for graph coloring (Q2467349) ‎ (← links)
• Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) ‎ (← links)
• Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) (Q2693046) ‎ (← links)
• A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) ‎ (← links)
• Computational Approaches to Max-Cut (Q2802547) ‎ (← links)
• Matrix Relaxations in Combinatorial Optimization (Q2897308) ‎ (← links)
• SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) ‎ (← links)
• An approximation algorithm for max<i>k</i>-uncut with capacity constraints (Q3225074) ‎ (← links)
• Approximability Distance in the Space of H-Colourability Problems (Q3392945) ‎ (← links)
• The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) ‎ (← links)
• (Q5240428) ‎ (← links)
• Remarks on Gaussian Noise Stability, Brascamp-Lieb and Slepian Inequalities (Q5255126) ‎ (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) ‎ (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) ‎ (← links)