On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function
- 1 September 2004
- journal article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 8 (3) , 267-294
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- A New Way of Using Semidefinite Programming with Applications to Linear Equations mod pJournal of Algorithms, 2001
- A remark on quadrant normal probabilities in high dimensionsStatistics & Probability Letters, 2001
- On the Hardness of Approximating the Chromatic NumberCombinatorica, 2000
- Relaxations of the Satisfiability Problem Using Semidefinite ProgrammingJournal of Automated Reasoning, 2000
- Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs1999
- Improved approximation algorithms for MAXk-CUT and MAX BISECTIONAlgorithmica, 1997
- Geometry of Spaces of Constant Curvature1993
- Numerical Computation of Multivariate Normal ProbabilitiesJournal of Computational and Graphical Statistics, 1992
- Geometric Algorithms and Combinatorial Optimization1988
- Matrix Analysis1985