Finding the maximum cut by the greedy algorithm
type: Item
instance of: scholarly article
title: Finding the maximum cut by the greedy algorithm
zbMATH Open document ID: 1403.05151
author: F. A. Sharifov
published in: Cybernetics and Systems Analysis
publication date: 2019-01-17T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7003026
zbMATH Keywords: maximum cut
zbMATH Keywords: bipartite subgraph
zbMATH Keywords: linear ordering
MaRDI profile type: Publication
full work available at URL: s10559-018-0075-3
OpenAlex ID: W2892794341
cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
cites work: Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem
cites work: .878-approximation algorithms for MAX CUT and MAX 2SAT
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time
cites work: Q5659589
cites work: Submodular functions and optimization.
DOI: 10.1007/S10559-018-0075-3
description: scientific article; zbMATH DE number 7003026