Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,216,438 papers from all fields of science
Search
Sign In
Create Free Account
Maximum cut
Known as:
Maximal cut
, MAX-CUT
, Bipartite subgraph
Expand
For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Approximation algorithm
Arc diagram
Cut (graph theory)
Decision problem
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2020
Review
2020
Natural evolution strategies and quantum approximate optimization
Tianchen Zhao
,
Giuseppe Carleo
,
James Stokes
,
S. Veerapaneni
arXiv.org
2020
Corpus ID: 218581176
A notion of quantum natural evolution strategies is introduced, which provides a geometric synthesis of a number of known quantum…
Expand
2016
2016
SORS: a scalable online ridesharing system
Blerim Cici
,
A. Markopoulou
,
Nikolaos Laoutaris
IWCTS@SIGSPATIAL
2016
Corpus ID: 5738109
In this paper, we design and evaluate SORS- a scalable online ridesharing system, where drivers and passengers send their…
Expand
2009
2009
Partial neighborhoods of elementary landscapes
L. D. Whitley
,
Andrew M. Sutton
Annual Conference on Genetic and Evolutionary…
2009
Corpus ID: 7940943
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are…
Expand
2009
2009
Robust estimation, regression and ranking with applications in portfolio optimization
Tri-Dung Nguyen
2009
Corpus ID: 118759551
Classical methods of maximum likelihood and least squares rely a great deal on the correctness of the model assumptions. Since…
Expand
2008
2008
Maximum Matching
M. Mucha
Encyclopedia of Algorithms
2008
Corpus ID: 10583811
Definition: • A matching for an undirected graph G is a subset M of the edges of G, called matched edges, such that no two edges…
Expand
2008
2008
Which submodular functions are expressible using binary submodular functions
Stanislav Živný
2008
Corpus ID: 15169590
Submodular functions occur in many combinatorial optimisation problems and a number of polynomial-time algorithms have been…
Expand
2006
2006
An Improved Maximum Neural Network Algorithm for Maximum Cut Problem
Jiahai Wang
2006
Corpus ID: 13126909
In this paper, we propose a new parallel algorithm that can help the maximum neural network escape from local minima for maximum…
Expand
2003
2003
Parallel Computing on Semidefinite Programs
S. Benson
2003
Corpus ID: 487578
This paper demonstrates how interior-point methods can use multiple processors efficiently to solve large semidefinite programs…
Expand
1999
1999
How to Extend the Concept of Convexity Cuts to Derive Deeper Cutting Planes
Marcus Porembski
Journal of Global Optimization
1999
Corpus ID: 42460749
A new type of cutting plane, termed a decomposition cut, is introduced that can be constructed under the same assumptions as the…
Expand
1992
1992
A New Approach to O -Line Packet Routing Case Study: 2-Dimensional Meshes
A. Symvonis
,
Jonathon Tidswell
1992
Corpus ID: 18439431
In this paper we present the multistage oo-line routing model, a new and rather natural, way to model oo-line packet routing…
Expand