Pages that link to "Item:Q4290088"
From MaRDI portal
The following pages link to Linear-Time Approximation Algorithms for the Max Cut Problem (Q4290088):
Displayed 3 items.
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs (Q860816) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- The expected relative error of the polyhedral approximation of the max- cut problem (Q1892101) (← links)