LAUSR

A folding preprocess for the max k-cut problem

Sign Up to like & get
recommendations!
0 Published in 2025 at "Optimization Letters"

DOI: 10.1007/s11590-025-02199-0

Abstract: Given graph G=(V,E)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G=(V,E)$$\end{document} with vertex set V and edge set E, the max k-cut problem seeks to partition the vertex set V into at most k… read more here.

Keywords: max cut; preprocess; problem; cut problem ... See more keywords

Improved time complexity for spintronic oscillator ising machines compared to a popular classical optimization algorithm for the Max-Cut problem

Sign Up to like & get
recommendations!
0 Published in 2024 at "Nanotechnology"

DOI: 10.1088/1361-6528/ad6f18

Abstract: Solving certain combinatorial optimization problems like Max-Cut becomes challenging once the graph size and edge connectivity increase beyond a threshold, with brute-force algorithms which solve such problems exactly on conventional digital computers having the bottleneck… read more here.

Keywords: max cut; time; time complexity;

Computing Max 3-Cut With CMOS Tripolar Oscillatory Cellular Neural Networks

Sign Up to like & get
recommendations!
0 Published in 2025 at "IEEE Transactions on Circuits and Systems II: Express Briefs"

DOI: 10.1109/tcsii.2025.3627078

Abstract: This brief presents an approach to solve Max 3-Cut problems using tripolar oscillatory cellular neural networks. We demonstrate the solution to Max 3-Cut can be formulated in terms of minimizing the Potts Hamiltonian. We propose… read more here.

Keywords: max cut; tripolar oscillatory; computing max; oscillatory cellular ... See more keywords

SSS Algorithms for Max-Cut

Sign Up to like & get
recommendations!
0 Published in 2025 at "INFORMS Journal on Computing"

DOI: 10.1287/ijoc.2024.0812

Abstract: The subgraph sampling scheme (SSS) is a technique originally introduced for Markov random fields. It is a powerful tool for designing heuristic algorithms for max-cut, quadratic unconstrained binary optimization (QUBO), and other optimization problems. The… read more here.

Keywords: max cut; methodology; history; algorithms max ... See more keywords