The following pages link to MAX CUT in cubic graphs (Q3159488):
Displaying 10 items.
- High-multiplicity cyclic job shop scheduling (Q957353) (← links)
- Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 (Q1018104) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- One-third-integrality in the max-cut problem (Q1924057) (← links)
- Maximum directed cuts in graphs with degree constraints (Q1926032) (← links)
- Improved approximation of Max-Cut on graphs of bounded degree (Q3150283) (← links)
- Maximum directed cuts in digraphs with degree restriction (Q3633002) (← links)
- MAX-CUT has a randomized approximation scheme in dense graphs (Q4885224) (← links)
- Local approximation of the maximum cut in regular graphs (Q5918122) (← links)
- A review on quantum approximate optimization algorithm and its variants (Q6546559) (← links)
