The following pages link to On the approximability of Max-Cut (Q873802):
Displaying 28 items.
- Rank of Handelman hierarchy for Max-Cut (Q408389) (← links)
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs (Q686456) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- On the complexity of finding balanced oneway cuts (Q1014383) (← links)
- Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 (Q1018104) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- Approximating \(\alpha\)-cuts with the vertex method (Q1311912) (← links)
- Node and edge relaxations of the max-cut problem (Q1319044) (← links)
- A randomized approximation scheme for metric MAX-CUT (Q1604207) (← links)
- Approximating graph-constrained max-cut (Q1800989) (← links)
- The expected relative error of the polyhedral approximation of the max- cut problem (Q1892101) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- On the practically interesting instances of MAXCUT (Q2957913) (← links)
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut (Q3020016) (← links)
- Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms (Q3503606) (← links)
- (Q4251055) (← links)
- Polynomial time approximation of dense weighted instances of MAX-CUT (Q4500688) (← links)
- On the optimality of the random hyperplane rounding technique for MAX CUT (Q4537629) (← links)
- Optimal Bounds for the <i>k</i> -cut Problem (Q5066939) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q5176000) (← links)
- Streaming Lower Bounds for Approximating MAX-CUT (Q5363106) (← links)
- Use of MAX-CUT for Ramsey Arrowing of Triangles (Q5412357) (← links)
- (Q5440597) (← links)
- Algorithms – ESA 2005 (Q5475891) (← links)
- (Q5875545) (← links)
- On complexity of the translational-cut algorithm for convex minimax problems (Q5925720) (← links)
- (Q6168453) (← links)
