Improved approximation algorithms for MAXk-CUT and MAX BISECTION
- 1 May 1997
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 18 (1) , 67-81
- https://doi.org/10.1007/bf02523688
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- MAX-CUT has a randomized approximation scheme in dense graphsRandom Structures & Algorithms, 1996
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM Journal on Optimization, 1995
- Complexity: Knots, Colourings and CountingsPublished by Cambridge University Press (CUP) ,1993
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Heuristic analysis, linear programming and branch and boundPublished by Springer Nature ,1980
- THE CORRELATION OF MAXIMA IN SAMPLES DRAWN FROM A BIVARIATE NORMAL DISTRIBUTION1Australian Journal of Statistics, 1965
- Notes on Generating Functions of Polynomials: (2) Hermite PolynomialsJournal of the London Mathematical Society, 1933