Sampling sub-problems of heterogeneous max-cut problems and approximation algorithms
From MaRDI portal
Recommendations
- Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
- .878-approximation algorithms for MAX CUT and MAX 2SAT
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- MAX-CUT has a randomized approximation scheme in dense graphs
- Random sampling in cut, flow, and network design problems
Cited in
(4)
This page was built for publication: Sampling sub-problems of heterogeneous max-cut problems and approximation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710711)