Volodymyr Shylo

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The maximum cut problem is a well-known NP-hard problem (Karp, 1972), which recently gathered a lot of interest due to a number of important (,) i j E ∈ is assigned a certain weight w ij. Let (,) V V 1 2 be a partition of the set of vertices V into two disjoint subsets. A cut (,) V V 1 2 in G is any subset of edges (,) , i j E ∈ such that i V ∈ 1 and j V ∈(More)
  • 1