New algorithms for the weighted maximum cut problem on graphs
type: Item
instance of: scholarly article
title: New algorithms for the weighted maximum cut problem on graphs
zbMATH Open document ID: 0841.05085
DOI: 10.1007/BF02366923
published in: Cybernetics and Systems Analysis
publication date: 1996-03-27T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 844548
zbMATH Keywords: NP-complete
zbMATH Keywords: weighted maximum cut problem
zbMATH Keywords: theory of dual estimates
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: algorithm
author: N. Z. Shor
author: O. A. Berezovskyi
MaRDI profile type: Publication
cites work: Q5596091
cites work: Linear Matrix Inequalities in System and Control Theory
cites work: Q4127646
cites work: Laplacian eigenvalues and the maximum cut problem
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Weakly bipartite graphs and the max-cut problem
cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time
cites work: Q4058442
cites work: Exact cuts in networks
cites work: Beweis einer Abschwächung der Hadwiger-Vermutung
cites work: Node-and edge-deletion NP-complete problems
full work available at URL: https://doi.org/10.1007/bf02366923
OpenAlex ID: W2032739865
description: scientific article; zbMATH DE number 844548