Pages that link to "Item:Q549567"

The following pages link to An efficient Lagrangian smoothing heuristic for max-cut (Q549567):

Displaying 2 items.

• Smoothed complexity of local max-cut and binary max-CSP (Q5144991) (← links)
• Smoothed Analysis of Local Search for the Maximum-Cut Problem (Q5384027) (← links)