Pages that link to "Item:Q4885224"
From MaRDI portal
The following pages link to MAX-CUT has a randomized approximation scheme in dense graphs (Q4885224):
Displaying 17 items.
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- A randomized approximation scheme for metric MAX-CUT (Q1604207) (← links)
- Approximating graph-constrained max-cut (Q1800989) (← links)
- Random sampling and approximation of MAX-CSPs (Q1886453) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- Hardness of fully dense problems (Q2643075) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time (Q3373669) (← 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)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Amplification and Derandomization without Slowdown (Q5129234) (← links)
- STACS 2005 (Q5710711) (← links)
- Local approximation of the maximum cut in regular graphs (Q5918122) (← links)
- Partitioning problems in dense hypergraphs (Q5957354) (← links)
