The maximum cut problem
From MaRDI portal
Publication:3059313
zbMATH Open1229.90151MaRDI QIDQ3059313FDOQ3059313
Authors: Walid Ben-Ameur, José Neto, A. R. Mahjoub 
Publication date: 8 December 2010
Recommendations
Cited In (26)
- Combinatorial and geometric properties of the max-cut and min-cut problems
- Optimal cuts in graphs and statistical mechanics
- Maximum cutwidth problem for graphs.
- Online Maximum Directed Cut
- A max-cut approximation using a graph based MBO scheme
- The max-out min-in problem: a tool for data analysis
- Maximum cut in fuzzy nature: models and algorithms
- Computational approaches to MAX-cut
- New algorithms for the weighted maximum cut problem on graphs
- Optimization via enumeration: A new algorithm for the max cut problem
- Complexity of the weighted max-cut in Euclidean space
- Maximum cuts for a minimum flow
- Contraction-based separation and lifting for solving the max-cut problem
- Cuts in undirected graphs. I
- NP-hardness of the Euclidean Max-Cut problem
- A remark on max-cut problem with an application to digital-analogue convertors
- Finding Folkman Numbers via MAX CUT Problem
- Optimization and optimality test for the Max-Cut Problem
- On graphs of the cone decompositions for the min-cut and max-cut problems
- From Graph Orientation to the Unweighted Maximum Cut
- New bounds for the maximum cut problem
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- The capacitated max \(k\)-cut problem
- Finding the maximum cut by the greedy algorithm
- Title not available (Why is that?)
- On fractional cut covers
This page was built for publication: The maximum cut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059313)
