The following pages link to (Q4607982):
Displaying 10 items.
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- A discrete dynamic convexized method for the max-cut problem (Q1761827) (← links)
- Approximating graph-constrained max-cut (Q1800989) (← links)
- Socially fair network design via iterative rounding (Q2084030) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- (Q3975935) (← links)
- On the optimality of the random hyperplane rounding technique for MAX CUT (Q4537629) (← links)
- Simultaneous max-cut is harder to approximate than max-cut (Q5092456) (← links)
- Streaming Lower Bounds for Approximating MAX-CUT (Q5363106) (← links)
- (Q5440597) (← links)
