Pages that link to "Item:Q3150283"

The following pages link to Improved approximation of Max-Cut on graphs of bounded degree (Q3150283):

Displaying 21 items.

• The performance of an eigenvalue bound on the max-cut problem in some classes of graphs (Q686456) (← links)
• High-multiplicity cyclic job shop scheduling (Q957353) (← links)
• Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
• Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
• Affine reductions for LPs and SDPs (Q1717229) (← links)
• Approximating graph-constrained max-cut (Q1800989) (← links)
• Maximum directed cuts in graphs with degree constraints (Q1926032) (← links)
• An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
• Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
• Triangle-free subcubic graphs with minimum bipartite density (Q2483477) (← links)
• From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
• MAX CUT in cubic graphs (Q3159488) (← links)
• Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring (Q4381058) (← links)
• (Q4558957) (← links)
• An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications (Q4806910) (← links)
• MAX-CUT has a randomized approximation scheme in dense graphs (Q4885224) (← links)
• Sparse graphs: Metrics and random models (Q5198669) (← links)
• The Ising Antiferromagnet and Max Cut on Random Regular Graphs (Q5864219) (← links)
• On judicious bipartitions of graphs (Q5915867) (← links)
• Local approximation of the maximum cut in regular graphs (Q5918122) (← links)
• Local improving algorithms for large cuts in graphs with maximum degree three (Q5937918) (← links)