Pages that link to "Item:Q4290088"

The following pages link to Linear-Time Approximation Algorithms for the Max Cut Problem (Q4290088):

Displaying 18 items.

• \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
• Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
• A linear time algorithm for the maximum capacity path problem (Q809905) (← links)
• A construction method for optimally universal hash families and its consequences for the existence of RBIBDs (Q860816) (← 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)
• The expected relative error of the polyhedral approximation of the max- cut problem (Q1892101) (← links)
• Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
• Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
• Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
• A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
• Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time (Q3373669) (← links)
• Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts (Q4554936) (← links)
• (Q4607980) (← links)
• Streaming Lower Bounds for Approximating MAX-CUT (Q5363106) (← links)
• (Q5440597) (← links)
• (Q5443201) (← links)
• (Q5875545) (← links)