Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
type: Item
instance of: scholarly article
title: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
zbMATH Open document ID: 0873.68078
DOI: 10.1007/BF02523688
published in: Algorithmica
publication date: 1997-10-09T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1002567
zbMATH Keywords: graph connectivity
zbMATH Keywords: randomized algorithms
zbMATH Keywords: semidefinite programming
Wikidata QID: Q57401556
author: Alan Frieze
author: Mark Jerrum
MaRDI profile type: Publication
cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
cites work: Q4234075
cites work: Q4230322
cites work: THE CORRELATION OF MAXIMA IN SAMPLES DRAWN FROM A BIVARIATE NORMAL DISTRIBUTION1
cites work: MAX-CUT has a randomized approximation scheme in dense graphs
cites work: Q4162318
cites work: .878-approximation algorithms for MAX CUT and MAX 2SAT
cites work: Optimization, approximation, and complexity classes
cites work: Q3253942
cites work: Notes on Generating Functions of Polynomials: (2) Hermite Polynomials
cites work: Q3140234
cites work: Heuristic analysis, linear programming and branch and bound
full work available at URL: https://doi.org/10.1007/bf02523688
OpenAlex ID: W1601503375
DBLP publication ID: journals/algorithmica/FriezeJ97
description: scientific article; zbMATH DE number 1002567